*AIM1|AIM-1*MCCARTHY, PREDICATE CALCULUS WITH UNDEFINED AS A TRUTH-VALUE|2|0|$ 1.85
*AIM2|AIM-2*MCCARTHY, SITUATIONS, ACTIONS, AND CAUSAL LAWS|11|0|$ 2.00
*AIM3|AIM-3*SAFIER, THE MIKADO AN AN ADVICE TAKER PROBLEM|0|0|$ 1.80
*AIM4|AIM-4*ENEA, CLOCK FUNCTION FOR LISP 1.5|0|0|$ .00
*AIM5|AIM-5*ENEA, WOOLDRIDGE, ALGEBRAIC SIMPLICATION|0|0|$ 1.75
*AIM6|AIM-6*WOOLDRIDGE, NON-PRINTING COMPILER|0|0|$ .00
*AIM7|AIM-7*MCCARTHY, PROGRAMS WITH COMMON SENSE|0|0|$ 1.90
*AIM8|AIM-8*MCCARTHY, STORAGE CONVENTIONS IN LISP 2|0|0|$ .00
*AIM9|AIM-9*WILLIAMS, COMPT EST FOR NO OF BISECTION OF AN NXN CHECKBD FOR N EVEN|0|0|$ .00
*AIM10|AIM-10*RUSSELL, IMPROVEMENTS IN LISP DEBUGGING|0|0|$ 1.80
*AIM11|AIM-11*WOOLDRIDGE, AN ALGEBRAIC SIMPLIFY PROGRAM IN LISP|0|0|$ .00
*AIM12|AIM-12*FELDMAN, DOCUMENTATION OF THE MACMAHON SQUARES PROBLEM|0|0|$ .00
*AIM13|AIM-13*WOOLDRIDGE, THE NEW LISP SYSTEM (LISP 1.55)|0|0|$ 1.80
*AIM14|AIM-14*MCCARTHY,COMPUTER CONTROL OF A MACHINE FOR EXPLORING MARS|0|0|$ 1.85
*AIM15|AIM-15*FINKELSTEIN, SAFIER, AXIOMATIZATION & IMPLEMENTATION|0|0|$ 1.85
*AIM16|AIM-16*MCCARTHY, A TOUGH NUT FOR PROOF PROCEDURES|0|0|$ 1.80
*AIM17|AIM-17*MCCARTHY, FOR DESCRIP. OF THE GAME OF PANG-KE|0|0|$ 1.75
*AIM18|AIM-18*HEXT, AN EXPRESSION INPUT ROUTINE FOR LISP|0|0|$ 1.85
*AIM19|AIM-19*HEXT, PROGRAMMING LANGUAGES & TRANSLATION|2|0|$ 2.10
*AIM20|AIM-20*REDDY, SOURCE LANGUAGE OPTIMIZATION OF FOR-LOOPS|1|0|$ 2.40
*AIM21|AIM-21*MITCHELL, LISP 2 SPECIFICATIONS PROPOSAL|65|0|$ 2.05
*AIM22|AIM-22*RUSSELL, KALAH-THE GAME & THE PROGRAM|20|0|$ 2.05
*AIM23|AIM-23*RUSSELL, IMPROVEMENTS TO THE KALAH PROGRAM|49|0|$ 2.05
*AIM24|AIM-24*MCCARTHY, A FORMAL DESCRIPTION OF A SUBSET OF ALGOL|55|0|$ 2.90
*AIM25|AIM-25*MANSFIELD, A FORMAL SYSTEM OF COMPUTATION|41|0|$ 1.90
*AIM26|AIM-26*REDDY, EXPERIM.ON AUTO.SPEECH RECOGN.BY A DIGITAL COMPUTER|24|0|$ 2.25
*AIM27|AIM-27*MCCARTHY, PROOF-CHECKER FOR PREDICATE CALCULUS|53|0|$ 1.90
*AIM28|AIM-28*MCCARTHY|0|6|$ 1.90
*AIM29|AIM-29*WILLIAMS, ISOLATION IMPRTNT FEATURES OF MULTITONED PICTURE|1|0|$ 2.00
*AIM30|AIM-30*FEIGENBAUM,WATSON,INIT.PROB.STATEM.FOR MACHINE INDUCT.RES.|0|0|$ 1.95
*AIM31|AIM-31*MCCARTHY, PLANS FOR THE STANFORD A.I. PROJECT|0|0|$ 2.20
*AIM32|AIM-32*RATCHFORD, THE 138 ANALOG DIGITAL CONVERTER|0|0|$ 1.95
*AIM33|AIM-33*HUBERMAN, THE ADVICE TAKER & GPS|15|0|$ 1.95
*AIM34|AIM-34*CARAH, A TV CAMERA INTERFACE FOR THE PDP-1|86|0|$ 1.95
*AIM35|AIM-35*SAFIER, SIMPLE SIMON|0|0|$ .00
*AIM36|AIM-36*PAINTER, UTILIZATION OF A TV CAMERA ON THE PDP-1|69|0|$ 1.85
*AIM37|AIM-37*KORSVOLD, AN ON LINE ALGEBRAIC SIMPLIFICATION PROGRAM|0|0|$ .00
*AIM38|AIM-38*WATERMAN, A FILTER FOR A MACHINE INDUCTION SYSTEM|57|0|$ 2.25
*AIM39|AIM-39*PINGLE, PROGRAM TO FIND OBJECTS IN A PICTURE|32|0|$ 2.30
*AIM41|AIM-41*ABRAMS, RODE, PROP.FOR PROOF-CHECK.FOR CERTAIN AXIOM SYS.|0|0|$ .00
*AIM42|AIM-42*PINGLE, PROPOSAL FOR A VISUAL INPUT ROUTINE|67|0|$ 2.00
*AIM44|AIM-44*PAINTER, SEM.CORRECT COMPLR FOR ALGOL-LIKE LANG(THESIS)|0|0|$ .00
*AIM45|AIM-45*KAPLAN, SOME COMPLET.RESULT IN MATH. THEORY OF COMP.|68|0|$ 2.30
*AIM47|AIM-47*BUCHANAN, LOGICS OF SCIENTIFIC DISCOVERY|0|0|$ .00
*AIM48|AIM-48*KAPLAN, CORRECTNESS OF COMPILER FOR ALGOL-LIKE PROGRAMS|25|0|$ 3.00
*AIM49|AIM-49*SUTHERLAND, DENDRAL-COMP.PROG.FOR GENER. & FILTER CHEMICAL|27|0|$ 2.65
*AIM50|AIM-50*HEARN, REDUCE USERS' MANUAL|1|0|$ 3.20
*AIM51|AIM-51*EARNEST, CHOOSING AN EYE FOR A COMPUTER|39|0|$ 6.00
*AIM52|AIM-52*SAMUEL, STUDIES IN MACHINE LEARN USING GAME CHECKERS II|12|0|$ 3.05
*AIM53|AIM-53*WEIHER, THE PDP-6 PROOF CHECKER|16|0|$ 3.00
*AIM54|AIM-54*LEDERBERG, FEIGENBAUM, MECH.OF INDUCT.INFER.ORGANIC CHEM|0|0|$ 2.60
*AIM55|AIM-55*FELDMAN, FIRST THOUGHTS OF GRAMMATICAL INFERENCE|60|0|$ 2.20
*AIM56|AIM-56*WICHMAN, OPTICAL FEEDBACK IN COMP.CONT. OF ARM-THESIS|78|0|$ 3.65
*AIM57|AIM-57*HEARN, REDUCE,USER-ORIENT INTERACT.SYS.ALGEBRA SIMP.|54|0|$ 3.65
*AIM58|AIM-58*CALLERO, ADAPT.COMMAND & CONT.SYS.UTIL.HEUR.LEARN(THESIS)|0|0|$ .00
*AIM59|AIM-59*KAPLAN, FORMAL THEORY CONCERN THE EQUIVALENCE OF ALGORITHMS|1|0|$ 2.30
*AIM60|AIM-60*KAPLAN, FORMAL THEORY ANLSIS STRNG EQUIV ELEMT PROG-THESIS|13|0|$ 9.05
*AIM61|AIM-61*ITO, NOTES ON THEORY COMPUTATION & PATTERN RECOGN|0|0|$ 5.75
*AIM62|AIM-62*BUCHANAN, SUTHERLAND, HEURISTIC DENDRAL|0|0|$ .00
*AIM63|AIM-63*KAPLAN, REG. EXPRESS. & THE EQUIVALANCE OF PROGRAMS|3|0|$ 2.90
*AIM64|AIM-64*MANNA, FORMALIZATION OF PROPERTIES OF PROGRAMS|0|0|$ .00
*AIM66|AIM-66*FELDMAN, ROVNER, AN ALGOL-BASED ASSOCIATIVE LANGUAGE|0|0|$ .00
*AIM67|AIM-67*FEIGENBAUM, A.I.: THEMES IN THE SECOND DECADE|0|0|$ .00
*AIM68|AIM-68*MANNA, PNUELI, VALIDITY PROBLEM OF 91-FUNCTION|15|0|$ 2.25
*AIM69|AIM-69*MCCARTHY ET AL, PROJECT TECHNICAL REPORT|1|0|$ 4.40
*AIM70|AIM-70*HEARN, THE PROBLEM OF SUBSTITUTION|21|0|$ 2.10
*AIM71|AIM-71*VICENS, PREPROCESSING FOR SPEECH ANALYSIS|0|0|$ 2.70
*AIM73|AIM-73*MCCARTHY, HAYES, PHILOSPCL.PROB.FROM STANDPT. OF A.I.|0|0|$ 3.25
*AIM75|AIM-75*SCHANK, NOTION LING CONCEPT:PRELUDE TO MECH TRANSLATION|0|0|$ .00
*AIM76|AIM-76*SCHANK, CONCEPTUAL PARSER FOR NATURAL LANGUAGE|0|0|$ .00
*AIM77|AIM-77*BECKER, MDL SMPL ANAL & INDCTVE PROCES SEMANTIC MEMORY SYS|0|0|$ 2.30
*AIM78|AIM-78*REDDY, USE ENVRMTL SNTC & PRBLSTC CONSTRNT IN VSN & SPEECH|1|0|$ 2.35
*AIM79|AIM-79*REDDY, NEELY, CONTXTAL ANALYSIS OF PHONEMES OF ENGLISH|11|0|$ 3.70
*AIM80|AIM-80*SUTHERLAND, HEURISTIC DENDRAL: A FAMILY OF LISP PROGRAMS|0|0|$ .00
*AIM81|AIM-81*LUCKHAM, REFINEMENT THEOREMS IN RESOLUTION THEORY|0|0|$ .00
*AIM82|AIM-82*MANNA, FRMLZTN PROPERTIES OF RECURSVLY DEFINED FUNCTIONS|0|0|$ .00
*AIM84|AIM-84*SMITH, MLISP USERS'S MANUAL|0|0|$ .00
*AIM86|AIM-86*HAYES, MACHINE-ORIENT FRMLTN OF EXTND FNCTNL CALCULUS|0|0|$ .00
*AIM87|AIM-87*MCCARTHY ET AL, PROJECT TECHNICAL REPORT|0|0|$ .00
*AIM88|AIM-88*SCHANK, LINGUISTICS FROM A CONCEPTUAL VIEWPOINT|0|0|$ .00
*AIM90|AIM-90*HEARN, STANDARD LISP|0|0|$ .00
*AIM91|AIM-91*CAMPBELL, HEARN, SMBLC ANLSIS OF FEYNMAN DIAGRAMS BY CMPTR|1|0|$ 3.75
*AIM92|AIM-92*SCHEINMAN, DESIGN OF A COMPUTER CONTROLLED MANIPULATOR|0|0|$ .00
*AIM93.1|AIM-93.1*FELDMAN, DCDBLTY RSLTS ON GRMTCL INFRNCE & CMPLITY|10|0|$ 2.55
*AIM94|AIM-94*COLBY ET AL, EXPRMT W/SRCH ALGRTM ON DTA BASE HUMAN BLF STR|1|0|$ 2.50
*AIM95|AIM-95*MANNA, CORRECTNESS OF NON-DETERMINISTIC PROGRAMS|0|0|$ .00
*AIM97|AIM-97*COLBY, SMITH, DILGS BTWN HMNS & ARTFCL BLF SYS|3|0|$ 2.50
*AIM99|AIM-99*BUCHANAN ET AL, UNDERSTNDG INFO PROCS SCI INFR IN ORGC CHEM|0|0|$ .00
*AIM100|AIM-100*MANNA, MCCARTHY, PROP OF PROGRAMS & PARTIAL FNTN LOGIC|0|0|$ 2.30
*AIM101|AIM-101*PAUL ET AL, COMPTR RPRSNTATN OF SMPLY DSCRBD SCENES|0|0|$ .00
*AIM102|AIM-102*WATERMAN, GNRLZTN LEARN FOR AUTO LEARN OF HEURISTICS|0|0|$ 3.95
*AIM103|AIM-103*ALLEN, LUCKHAM, INTERACTIVE THEOREM-PROVE PROGRAM|21|0|$ 2.45
*AIM104|AIM-104*LEDERBERG ET AL, HRSTC PRGRM SOLV SCI INFRNCE PRBLM|22|0|$ 2.15
*AIM105|AIM-105*HEUCKEL, OPRTR WHICH LOCTS EDGES IN DGTZD PICTURES|0|0|$ .00
*AIM106|AIM-106*KAHN,NEAR-MIN-TIME CNTRL OPN-LOOP ART KINMTC CHNS-THESIS|0|0|$ 6.50
*AIM107|AIM-107*FALK, IMPLCTNS OF PLANARITY FOR MACHINE PERCEPTION|0|0|$ 2.50
*AIM108|AIM-108*KELLY, EDGE DTCTN IN PCTRS BY CMPTR USING PLNG|0|0|$ .00
*AIM109|AIM-109*SCHANK ET AL, SPINOZA II: CNCPTAL CASE-BASE NTRL LANG ANLS|0|0|$ .00
*AIM110|AIM-110*ASHCROFT, MANNA, FORMALIZATION OF PARALLEL PROG PROPS|0|0|$ .00
*AIM111|AIM-111*MANNA,SECOND-ORDER MATH THEORY OF COMPUTATION|0|0|$ 2.45
*AIM112|AIM-112*HILF ET AL, MACHINE-MEDIATED INTERVIEWING|0|0|$ .00
*AIM113|AIM-113*COLBY ET AL, MUTE PATIENT EXPERIENCE W/MACHINE INTERVIEW|0|0|$ .00
*AIM114|AIM-114*BIERMANN, FELDMAN, SYNTHESIS OF FINITE-STATE ACCEPTORS|0|0|$ .00
*AIM115|AIM-115*MONTANARI, OPTIMAL DETECTION OF CRVS IN NOISY PCTRS|32|0|$ 2.70
*AIM116|AIM-116*COLBY, MIND & BRAIN, AGAIN|0|0|$ .00
*AIM117|AIM-117*MCCARTHY ET AL, PROJECT TECHNICAL REPORT|0|0|$ 3.95
*AIM118|AIM-118*MONTANARI, HURSTCLY GUIDED SEARCH & CHROMOSOME MATCH|22|0|$ 2.50
*AIM119|AIM-119*BECKER, INFO-PROCES MODEL OF INTRMEDAT-LVL COGNITION-THESIS|0|0|$ .00
*AIM120|AIM-120*COLBY, SMITH, CPTR CTLST TREATMT OF NNSPKG AUTISTIC CHILD|3|0|$ 2.60
*AIM121|AIM-121*SOBEL, CAMERA MODELS & MACHINE PERCEPTION-THESIS|0|0|$ .00
*AIM122|AIM-122*SCHANK, `SEMANTICS' IN CONCEPTUAL ANALYSIS|0|0|$ .00
*AIM123|AIM-123*BUCHANAN ET AL, SPCLATN ABOUT A.I. & LEGAL RESNG|0|0|$ 3.20
*AIM124|AIM-124*ASTRAHAN, SPECH ANALS BY CLUSTRG, OR HYPERPHONEME MTHD|47|0|$ 2.30
*AIM125|AIM-125*COLBY ET AL, ARTIFICIAL PARANOIA|4|0|$ 2.75
*AIM149|AIM-149*SCHMIDT,REAL-TIME CONTROL OF A COMPUTER DRIVEN VEHICLE|99|0|$ 6.75
*AIM150|AIM-150*FLOYD, TOWARD INTERACTIVE DESIGN OF CORRECT PROGRAMS|0|0|$ 2.05
*CS1|STAN-CS-63-001*ROSEN,PRIMAL PARTITION PROGRAMMING|0|0|$ .00
*CS2|STAN-CS-63-002*PAVKOVICH,SSLUTION ALGEBRAIC SYSTEMS|0|0|$ .00
*CS3|STAN-CS-64-003*FORSYTHE,THEOREMS BY SAULEV|0|0|$ .00
*CS4|STAN-CS-64-004*BERGMAN,HERRIOT,NUMER SOLN BDRY VALUE BY INT OPERS|1|0|$ 2.40
*CS5|STAN-CS-64-005*ROSEN,EQUIL PTS FOR CONCAVE N-PERSON GAMES|1|0|$ 2.55
*CS6|STAN-CS-64-006*HOCKNEY,SOLUTION POISSON'S EQUATION|0|0|$ .00
*CS7|STAN-CS-64-007*ROSEN,SUFF.COND.OPT.CONTROL CONVEX PROC.|0|0|$ 2.60
*CS8|STAN-CS-64-008*GOLUB & KAHAN,CALCULATING SINGULAR VALUES|0|0|$ .00
*CS9|STAN-CS-64-009*ANDERSON,Q-D ALGORITHM|0|0|$ .00
*CS10|STAN-CS-64-010*CAUSEY,NORMAL MATRICES(THESIS)|0|0|$ .00
*CS11|STAN-CS-64-011*NAKAMURA,ROSEN,ELASTIC-PLASTIC ANAL OF TRUSSES|1|0|$ 2.65
*CS12|STAN-CS-64-12*GOLUB & BUSINGER,NUMERICAL METHODS|0|0|$ .00
*CS13|STAN-CS-64-013*PEREYRA,ROSEN,COMPUT.OF PSEUDOINVERSE|0|0|$ 2.55
*CS14|STAN-CS-64-014*EFIMENKO,EIGENVALUES AND EIGENFUNCTIONS IN PDE|0|0|$ 2.30
*CS15|STAN-CS-65-015*GRACE,NON-ISOMORPHIC CONVEX POLYHEDRA|0|0|$ 5.80
*CS16|STAN-CS-65-016*FORSYTHE & GOLUB,MAXIMIZING 2ND DEGREE POLYNOMIAL|0|0|$ .00
*CS17|STAN-CS-65-017*FORSYTHE,WIRTH,AUTOMATIC GRADING PROGRAMS|1|0|$ 2.20
*CS18|STAN-CS-65-018*PEREYRA,DIFFERENCE CORRECTION METHOD|0|0|$ .00
*CS19|STAN-CS-65-019*AGEEV,MACLAREN,RUSSIAN ALGOL IN ENGLISH|1|0|$ 1.90
*CS20|STAN-CS-65-020*WIRTH & WEBER,EULER:ALGOL & DEFINITION|0|0|$ .00
*CS21|STAN-CS-65-021*FISHER ET AL,VECTORCARDIOGRAPHIC ANALYSIS|0|0|$ .00
*CS22|STAN-CS-65-022*MOLER,FINITE DIFFERENCE METHODS|0|0|$ .00
*CS23|STAN-CS-65-023*RUDIN,CONVEX POLYNOMIAL APPROXIMATION|0|0|$ 3.00
*CS24|STAN-CS-65-024*KLYUYEV ET AL.,LINEAR ALGEBRAIC SYSTEMS|0|0|$ .00
*CS25|STAN-CS-65-025*HODGE,YIELD-PT LOAD BY NONLINEAR PROGRAMMING|2|0|$ 2.40
*CS26|STAN-CS-65-026*FORSYTHE,S.U. PROGRAM IN COMP. SCI.|0|0|$ .00
*CS27|STAN-CS-65-027*VOLKOV,METHOD OF NETS FOR POISSON EQUATION|0|0|$ 2.60
*CS28|STAN-CS-65-028*MILLER,STRANG,MATRIX THMS FOR PDE'S|0|0|$ 2.70
*CS29|STAN-CS-65-029*PEREYRA,IMPROVING APPROXIMATE SOLUTION|0|0|$ .00
*CS30|STAN-CS-65-030*MARCHUK,AUTOMATIC CONSTRUCTION ALGORITHMS|0|0|$ .00
*CS31|STAN-CS-65-031*RAVIART,WEAK SOLS LINEAR PARABOLIC EQNS|1|0|$ 3.35
*CS32|STAN-CS-65-032*HOCKNEY,MINIMUM MULTIPLICATION FOURIER ANAL|0|0|$ 3.30
*CS33|STAN-CS-65-033*WIRTH,PROG LANG FOR 360 COMPUTERS|0|0|$ .00
*CS34|STAN-CS-66-034*VARAH,EIGENVECTORS OF REAL MATRIX|0|0|$ .00
*CS35|STAN-CS-66-035*WIRTH & HOARE,DEVELOPMENT OF ALGOL|0|0|$ .00
*CS36|STAN-CS-66-036*TRAUB,CALCULATION OF ZEROS|0|0|$ .00
*CS37|STAN-CS-66-037*REYNOLDS,COGENT 1.2 OPERATIONS MANUAL|4|0|$ 2.70
*AIM40|AIM-40*MCCARTHY,PAINTER,CORRECTNESS OF A COMPILER|0|297|$ 2.10
*CS38|SAME
*CS39|STAN-CS-66-039*FORSYTHE,HOW DO YOU SOLVE EQUATION?|0|0|$ .00
*CS40|STAN-CS-66-040*FORSYTHE,HOW DO YOU SOLVE EQUATION?|0|0|$ .00
*CS41|STAN-CS-66-041*KAHAN,ACCURATE EIGENVALUES|0|0|$ .00
*CS42|STAN-CS-66-042*KAHAN,WHEN NEGLECT OFF-DIAG ELTS SYMM TRI-DIAG MTX|2|0|$ 2.00
*CS43|STAN-CS-66-043*VARAH & KAHAN,TWO WORKING ALGORITHMS|0|0|$ .00
*CS44|STAN-CS-66-44*KAHAN,RELAXATION METHODS|0|0|$ .00
*CS45|STAN-CS-66-045*KAHAN, RELAXATION METHODS SEMI-DEFINITE|0|0|$ .00
*CS46|STAN-CS-66-046*FORSYTHE,COMPUTATIONAL METHODS|0|0|$ .00
*CS47|STAN-CS-66-047*ABRAMS,"IVERSON NOTATION"|0|0|$ .00
*CS48|STAN-CS-66-048*MCKEEMAN,COMPUTER LANG DESIGN(THESIS)|0|0|$ .00
*AIM43|AIM-43*REDDY,COMPUTER SPEECH RECOGNITION|0|300|$ 6.00
*CS49|SAME
*AIM46|AIM-49*PERSSON,SEQUENCE EXTRAPOLATING PROGRAMS|0|300|$ 7.00
*CS50|SAME
*CS51|STAN-CS-66-051*BERGMAN,HERRIOT,KURTZ,TRANSONIC FLOW PATTERNS|4|0|$ 2.75
*CS52|STAN-CS-66-052*SHAW,SYSTEMS PROGRAMMING|0|0|$ .00
*CS53|STAN-CS-66-053*WIRTH,PROG LANG FOR 360 COMPUTERS|0|0|$ .00
*CS54|STAN-CS-67-054*GOLUB & ROBERTSON,BAIRSTOW ALGORITHM|0|0|$ .00
*CS55|STAN-CS-67-055*ADAMS,STOPPING CRITERION FOR POLYN.ROOT-FINDING|3|0|$ 2.05
*CS56|STAN-CS-67-056*BAUER,QD-METHOD WITH NEWTON SHIFT|0|0|$ 1.90
*CS57|STAN-CS-67-057*GRIES,TRANSITION MATRICES|0|0|$ .00
*CS58|STAN-CS-67-058*TIXIER,RECURSIVE FUNCTIONS(THESIS)|0|0|$ .00
*CS59|STAN-CS-67-059*WILKINSON,ALMOST DIAGONAL MATRICES|0|0|$ .00
*CS60|STAN-CS-67-060*WILKINSON,TWO ALGORITHMS LINEAR INTERPOLATION|0|0|$ .00
*CS61|STAN-CS-67-061*FORSYTHE,ASYMPTOTIC DIRECTIONS S-DIMENSIONAL|0|0|$ .00
*CS62|STAN-CS-67-062*TIENARI,VARYING LENGTH FLOATING-PT ARITH|0|0|$ 2.85
*CS63|STAN-CS-67-063*POLYA,GRAEFE'S METHOD EIGENVALUES|0|0|$ .00
*CS64|STAN-CS-67-064*RICHMAN,FLOATING-PT NUMBER REPRESENTATIONS|1|0|$ 2.65
*CS65|STAN-CS-67-065*WIRTH,BASIC CONCEPTS PROG LANGUAGES|0|0|$ .00
*CS66|STAN-CS-67-067*BARTELS & GOLUB,CHEBYSHEV SOLUTIONS LINEAR EQUATIONS|0|0|$ .00
*CS67|STAN-CS-67-067*BARTELS & GOLUB,CHEBYSHEV SOLUTIONS LINEAR EQUATIONS|0|0|$ .00
*CS68|STAN-CS-67-068*WIRTH,PL 360 SYSTEM|0|0|$ .00
*CS69|STAN-CS-67-070*FELDMAN & GRIES,TRANSLATOR WRITING SYSTEMS|0|0|$ .00
*CS70|STAN-CS-67-70*BERGMAN ET AL,COMPUTATION FLOW PATTERNS|0|0|$ .00
*CS71|STAN-CS-67-071*JENKINS,TRAUB,AUTOMATIC POLYNOMIAL SOLVER|2|0|$ 2.85
*CS72|STAN-CS-67-072*GOLUB,SMITH,CHEBYSHEV APPROX BY CHEBYSHEV SYSTS|3|0|$ 3.30
*CS73|STAN-CS-67-073*BUSINGER & GOLUB,LEAST SQUARES|0|0|$ .00
*CS74|STAN-CS-67-074*FORSYTHE,WHAT IS SATISFACTORY QUAD-EQ SOLVER?|2|0|$ 2.00
*CS75|STAN-CS-67-075*BAUER,THEORY OF NORMS|0|0|$ .00
*CS76|STAN-CS-67-076*ANSELONE,COLLECTIVELY COMPACT OPERATOR APPROX.|0|0|$ 3.50
*CS77|STAN-CS-67-77*FORSYTHE,WHAT TO DO  TILL|0|0|$ .00
*CS78|STAN-CS-67-078*COLBY & ENEA,MACHINE UTIL "GOOD"|0|0|$ .00
*CS79|STAN-CS-67-079*DORAN,360 U.S. FORTRAN IV|0|0|$ .00
*CS80|STAN-CS-67-080*FRIEDMAN,DIRECTED RANDOM GENERATION|0|0|$ .00
*CS81|STAN-CS-67-081*GOLUB,WELSCH,GAUSS QUADRATURE RULES|5|0|$ 2.55
*CS82|STAN-CS-67-082*TESLER,ENEA,COLBY,DIGRAPH REPR BELIEF SYSTEMS|0|0|$ 2.65
*CS83|STAN-CS-68-083*BJORCK & GOLUB,ITERATIVE REFINEMENTS|0|0|$ .00
*CS84|STAN-CS-68-084*FRIEDMAN,SYSTEM FOR TRANSFORMATIONAL GRAMMAR|0|0|$ 2.65
*CS85|STAN-CS-68-085*COLBY,COMPUTER-AIDED LANG DEVEL|0|0|$ .00
*CS86|STAN-CS-68-086*BAUER ET AL.,ALGOL W|0|0|$ .00
*CS87|STAN-CS-68-087*EHRMAN,CS139 LECTURE NOTES|0|0|$ .00
*CS88|STAN-CS-68-088*SCHECHTER,RELAXATION METHODS|4|0|$ .00
*CS89|STAN-CS-68-089*BAUER ET AL.,ALGOL W (REV.)|0|0|$ .00
*CS90|STAN-CS-68-090*LESSER,MULTI-LEVEL COMPUTER|0|0|$ .00
*CS91|STAN-CS-68-091*WIRTH ET AL.,PL360 SYSTEM|0|0|$ .00
*CS92|STAN-CS-68-092*ENEA,MLISP|0|0|$ .00
*CS93|STAN-CS-68-93*FORSYTHE, CS & EDUCATION|0|0|$ .00
*CS94|STAN-CS-68-094*SHAW,FORMAL DESCR & PARSING OF PICTURES|0|0|$ 7.85
*SLACR84|SAME
*CS95|STAN-CS-68-095*FRIEDMAN & DORAN,FORMAL SYNTAX TRANS GRAM|0|0|$ .00
*CS96|STAN-CS-68-096*SMITH,INTERVAL ARITH DET EVAL AND TESTING CHEB SYST|1|0|$ 2.50
*CS97|STAN-CS-68-097*MILLER,RESEARCH CSD|0|0|$ .00
*CS98|STAN-CS-68-098*BAUER ET AL.,ALGOL W IMPLEMENTATION|0|0|$ .00
*CS99|STAN-CS-68-099*FRIEDMAN,LECTURE NOTES|0|0|$ .00
*CS100|STAN-CS-68-100*BREDT,MODEL OF INFORM. PROC. IN CHILDREN|0|0|$ 3.50
*CS101|STAN-CS-68-101*KAPLAN,FORMAL STRONG EQUIV FOR ELEMENTAL PGMS|0|300|$ 9.60
*CS102|STAN-CS-68-102*PNUELI,INTEGER PROGRAMMING OVER A CONE|4|0|$ 2.60
*CS103|STAN-CS-68-103*BREDT & FRIEDMAN,LEXICAL INSERTION|0|0|$ .00
*CS104|STAN-CS-68-104*BARTELS,NUMERICAL INVESTIGATION SIMPLEX METHOD|0|0|$ .00
*CS105|STAN-CS-68-105*RICHMAN, EPSILON CALCULUS|0|0|$ 5.85
*AIM65|AIM-65*HUBERMAN, PROGRAM TO PLAY CHESS END GAMES-THESIS|0|0|$ 9.60
*CS106|SAME
*CS106|STAN-CS-68-106*HUBERMAN,PROGRAM TO PLAY CHESS END GAMES|0|0|$ .00
*CS107|STAN-CS-68-107*JENKINS,THREE-STAGE VARIABLE-SHIFT|3|0|$ .00
*CS108|STAN-CS-68-108*FRIEDMAN,COMPUTER EXPERIMENTS|0|0|$ .00
*CS109|STAN-CS-68-109*FRIEDMAN,COMPUTER SYSTEM WRITING TRANS GRAM|0|0|$ .00
*CS110|STAN-CS-68-110*BAUER ET AL.,ALGOL W (REVISED)|0|0|$ 4.80
*CS111|STAN-CS-68-111*FRIEDMAN & MARTNER,ANALYSIS TRANS GRAM|0|0|$ .00
*CS112|STAN-CS-68-112*FRIEDMAN & POLLACK,CONTROL LANG TRANS GRAM|0|0|$ .00
*CS113|STAN-CS-68-113*HANSEN,IMPACT STORAGE MANAGEMENT|0|0|$ .00
*CS114|STAN-CS-68-114*GEORGE,CALGEN-AN INTERACTIVE PICTURE|0|0|$ .00
*CS115|STAN-CS-68-115*FRIEDMAN ET AL,PROGRAMMER'S MANUAL|0|0|$ .00
*AIM72|AIM-72*PIEPER, KINEMATICS OF MANIP.UNDER COMP.CONTRL.|0|0|$ .00
*CS116|SAME
*CS117|STAN-CS-68-117*ADAMS,COMP MODEL DATA-FLOW SEQUENCING|0|0|$ .00
*AIM74|AIM-74*WATERMAN, MACHINE LEARNING OF HEURISTICS-THESIS|0|0|$ .00
*CS118|SAME
*CS119|STAN-CS-68-119*DANTZIG ET AL.,MATH PROG LANG|0|0|$ .00
*CS120|STAN-CS-68-120*SATTERTHWAITE,MUTANT 0.5:PROG LANG|0|0|$ .00
*CS121|STAN-CS-69-121*MOLER,EIGENVALUES OF LAPLACIAN,RHOMBICAL DOM|5|0|$ 2.20
*CS122|STAN-CS-69-122*MITCHELL & MCCRAITH,HEURISTIC ANALYSIS|1|0|$ 2.35
*CS123|STAN-CS-69-124*GOLUB,MATRIX DECOMPOSITIONS|0|0|$ .00
*CS124|STAN-CS-69-124*GOLUB,MATRIX DECOMPOSTIONS|0|0|$ .00
*AIM89|AIM-89*FELDMAN ET AL, GRAMTCL CMPLXTY & INFERENCE|5|0|$ 4.50
*CS125|SAME
*CS126|STAN-CS-69-126*DANTZIG,COMPLEMENTARY SPANNING TREES|11|0|$ 2.00
*AIM85|AIM-85*VICENS, ASPTS OF SPEECH RECOGNTN BY COMPTR-THESIS|0|0|$ 8.00
*CS127|SAME
*CS128|STAN-CS-69-128*BUZBEE ET AL.,ODD/EVEN REDUCTION|0|0|$ 2.90
*CS129|STAN-CS-69-129*MILLER, RESEARCH IN CSD|8|0|$ 4.15
*AIM83|AIM-83*SCHANK, REPR FOR COMPUTER-ORIENTED SEMANTICS(THESIS)|0|0|$ .00
*CS130|SAME
*CS131|STAN-CS-69-131*SMITH,MAN-MACHINE INTERACTION(THESIS)|1|0|$ .00
*CS133|STAN-CS-69-133*GOLUB & REINSCH,HANDBOOK SERIES LINEAR ALGEBRA|0|0|$ 2.85
*CS134|STAN-CS-69-134*GOLUB & SAUNDERS,LINEAR LEAST SQUARES|0|0|$ .00
*CS135|STAN-CS-69-135*GRIES,COMPILER IMPLEMENTATION LANG|0|0|$ .00
*CS136|STAN-CS-69-136*POHL,BI-DIRECTIONAL AND HEURISTIC SEARCH|2|0|$ 6.40
*CS137|STAN-CS-69-137*HENRICI,FIXED POINTS ANALYTIC FUNCTIONS|7|0|$ 1.90
*AIM96|AIM-96*GREEN, APLCTN THERM PROVG TO QSTN-ANSRG SYS-THESIS|0|0|$ .00
*CS138|SAME
*AIM98|AIM-98*HORNING, STUDY OF GRAMMATICAL INFRENCE-THESIS|12|0|$ 6.35
*CS139|SAME
*CS140|STAN-CS-69-140*FORSYTHE,DESIGN-THEN & NOW|5|0|$ .00
*CS141|STAN-CS-69-141*DAHLQUIST ET AL., BOUNDS FOR ERROR|0|0|$ 2.50
*CS142|STAN-CS-69-142*GOLUB & UNDERWOOD,STATIONARY VALUES|1|0|$ 2.35
*CS143|STAN-CS-69-143*JENKINS,THREE-STAGE VARIABLE-SHIFT|0|0|$ .00
*CS144|STAN-CS-69-143*FORSYTHE,POSITIVE DEFINITE QUAD POLYNOMIAL|15|0|$ .00
*CS145|STAN-CS-69-145*HENRICI,SOLVING POLYNOMIAL EQUATIONS|11|0|$ 2.45
*CS146|STAN-CS-70-146*RAMOS,ROUNDOFF ERROR ANALYSIS|4|0|$ 2.50
*CS147|STAN-CS-70-147*FORSYTHE,PITFALLS IN COMPUTATION|0|0|$ .00
*CS148|STAN-CS-70-148*KNUTH & FLOYD,AVOIDING "GO TO" STATEMENTS|0|0|$ .00
*CS149|STAN-CS-70-149*KNUTH,OPTIMUM BINARY SEARCH TREES|0|0|$ .00
*CS150|STAN-CS-70-150*WILKINSON,ELEMENTARY PROOF|12|0|$ 2.50
*CS151|STAN-CS-70-151*VOLKOV(TRANS. FORSYTHE),SOLUTION LAPLACE'S EQUATION|9|0|$ 2.50
*CS152|STAN-CS-70-152*GUSTAFSON,RAPID COMPUTATION INTERPOLATION FORM|9|0|$ 2.40
*CS153|STAN-CS-70-153*GUSTAFSON,ERROR PROPAGATION|6|0|$ 2.20
*CS154|STAN-CS-70-154*STONE,INCORRECTLY DECODED BURSTS|6|0|$ 2.40
*CS155|STAN-CS-70-155*BUZBEE ET AL.,ODD/EVEN REDUCTION (2)|3|0|$ 2.80
*CS156|STAN-CS-70-156*DANTZIG,COMPUTING ROUNDOFF ERROR|5|0|$ 1.85
*CS157|STAN-CS-70-157*BRENT,ALGORITHMS MATRIX MULTIPLICATON|0|0|$ .00
*CS158|STAN-CS-70-158*STONE,PARALLEL PROCESSING|3|0|$ 2.80
*CS159|STAN-CS-70-159*GEORGE,SOLUTION DISCRETE POISSON EQUATION|0|0|$ 1.75
*CS160|STAN-CS-70-160*BREDT & MCCLUSKEY,PARALLEL COMPUTER SYSTEMS|0|0|$ .00
*CS161|STAN-CS-70-161*HOFFMAN,FORMULARY MODEL ACCESS CONTROL(THESIS)|2|0|$ 3.55
*CS162|STAN-CS-70-162*BARTELS ET AL.,NUMERICAL TECHNIQUES MATH PROG|0|0|$ 3.55
*CS163|STAN-CS-70-163*MALCOLM,ALGORITHM FOR FLOATING POINT|7|0|$ 2.35
*CS164|STAN-CS-70-164*KAUFMAN,ESTIMATES ROUNDOFF ERROR|14|0|$ 2.20
*CS165|STAN-CS-70-165*BAUER & STONE,N TASKS WITH M OPERATIONS|1|0|$ 2.70
*AIM128|AIM-128*SANDEWALL, RPRSNTG NATURAL-LNGUGE INFO PRDICT CALCULUS|0|0|$ .00
*CS166|SAME
*AIM129|AIM-129*IGARASHI, SEMANTICS OF ALGOL-LICK STATEMENTS|0|0|$ 4.55
*CS167|SAME
*AIM130|AIM-130*KELLY, VSUL I.D. OF PEOPLE BY COMPUTER-THESIS|0|0|$ 8.85
*CS168|SAME
*AIM126|AIM-126*KNUTH,EXAMPLES OF FORMAL SEMANTICS|0|0|$ 2.70
*CS169|SAME
*CS170|STAN-CS-70-170*BREDT,CONCURRENT SEQUENTIAL PROG|3|0|$ 3.20
*CS171|STAN-CS-70-171*BREDT,MODELS PARALLEL COMPUTING|0|0|$ .00
*CS172|STAN-CS-70-172*BREDT,ANALYSIS PARALLEL SYSTEMS(THESIS)|0|0|$ .00
*CS173|STAN-CS-70-173*BREDT,MUTUAL EXCLUSION PROBLEM|0|0|$ .00
*AIM127|AIM-127*MANNA, WALDINGER, TWRDS AUTO PROGRAM SYNTHESIS|65|0|$ 3.20
*CS174|SAME
*CS175|STAN-CS-70-175*MALCOLM,EUCLIDEAN INNER PRODUCTS|9|0|$ 1.85
*AIM131|AIM-131*FEIGENBAUM ET AL ON GENERALITY & PROBLEM SOLVING|0|0|$ .00
*CS176|SAME
*CS177|STAN-CS-70-177*FORSYTHE & MILLER, RESEARCH REVIEW|10|0|$ 2.15
*CS178|STAN-CS-70-178*FORSYTHE & MILLER,RESEACH REVIEW|4|0|$ .00
*AIM135|AIM-135*SMITH, MLISP|63|0|$ 4.50
*CS179|SAME
*AIM132|AIM-132*FLAK,CMPTR INTPRT IMPRFT LINE DTA AS 3D SCNE-THESIS|0|0|$ 7.30
*CS180|SAME
*AIM133|AIM-133*HEARN, REDUCE 2|0|0|$ .00
*CS181|SAME
*AIM134|AIM-134*TENENBAUM, ACMDATN IN COMPUTER VISION-THESIS|0|0|$ .00
*CS182|SAME
*AIM136|AIM-136*WHITE, MCHN LEARN THRU SGNTR TREES APPLY TO HUMAN SPEECH|0|0|$ .00
*CS183|SAME
*CS184|STAN-CS-70-184*MALCOLM,NOTE ON CONJECTURE OF MORDELL|5|0|$ 1.85
*CS185|STAN-CS-70-185*NELSON,GRAPH PROGRAM SIMULATION|0|0|$ .00
*AIM137|AIM-137*KNUTH, AN EMPIRICAL STUDY OF FORTRAN IN USE|0|0|$ .00
*CS186|SAME
*CS187|STAN-CS-70-187*DANTZIG ET AL.,MATH PROG LANG SPEC MANUAL|0|0|$ .00
*AIM138|AIM-138*ASHCROFT&MANNA,TRNSLAT OF GO-TO PRGM TO WHILE PRGM|0|0|$ 2.50
*CS188|SAME
*AIM139|AIM-139*MANNA, MATH THEORY OF PARTIAL CORRECTNESS|120|0|$ 2.40
*CS189|SAME
*CS190|STAN-CS-70-190*HOPCROFT,N LOG N ALGORITHM|0|0|$ .00
*CS191|STAN-CS-70-191*LESSER,INTRO TO DIRECT EMULATION|0|0|$ .00
*CS192|STAN-CS-70-192*HOPCROFT,N LOG N ALGORITHM|9|0|$ 1.90
*AIM140|AIM-140*SCHANK, INTENTION MEMORY & COMPUTER UNDERSTANDING|0|0|$ .00
*CS193|SAME
*CS194|STAN-CS-70-194*KNUTH,ERRATA & ADDENDA|0|0|$ .00
*CS195|STAN-CS-70-195*BUZBEE ET AL.,DISCRETE POISSON EQUATION|5|0|$ 2.60
*CS196|STAN-CS-70-196*MOLER,MATRIX COMPUTATIONS|11|0|$ 2.10
*CS197|STAN-CS-71-197*KNUTH & SITES,MIX/360 USER'S GUIDE|6|0|$ 2.05
*CS198|STAN-CS-71-198*BRENT,ALGORITHMS FOR FINDING ZEROS|0|0|$ .00
*CS199|STAN-CS-71-199*STAFF,BIBLIOGRAPHY CSD REPORTS|0|0|$ .00
*CS200|STAN-CS-71-200*HERRIOT,ALGOL 60 PROCEDURES|0|0|$ .00
*CS201|STAN-CS-71-201*HOPCROFT & TARJAN*PLANARITY TESTING|0|0|$ 2.25
*CS202|STAN-CS-71-202*SAAL & RIDDLE,COMMUNICATING SEMAPHORES|0|0|$ .00
*AIM141|AIM-141*BUCHANAN ET AL, HRSTC DENDRAL PRGM FOR EXPLAIN EMPIRCL DTA|0|0|$ .00
*CS203|SAME
*CS204|STAN-CS-71-204*INGALLS,FETE-FORTRAN TIME ESTIMATOR|0|0|$ .00
*AIM142|AIM-142*MILNER, ALGBRC DEFNTN SMULTN BTWN PRGMS|0|0|$ 2.30
*CS205|SAME
*CS206|STAN-CS-71-206*KNUTH, MATH ANALYSIS ALGORITHMS|0|0|$ 2.25
*CS207|STAN-CS-71-207*HOPCROFT & TARJAN,EFFICIENT ALGORITHMS|1|0|$ .00
*CS208|STAN-CS-71-208*GEORGE,FINITE ELEMENT METHOD(THESIS)|0|0|$ .00
*AIM143|AIM-143*MCCARTHY ET AL, PROJECT TECH REPORT|1|0|$ 4.10
*CS209|SAME
*CS210|STAN-CS-71-210*PURDY, ACCESS,PROG FOR CATALOG|1|0|$ 2.55
*CS211|STAN-CS-71-211*MALCOLM,ALGORITHM TO REVEAL PROPERTIES|6|0|$ .00
*CS212|STAN-CS-71-212*MORGANA,TIME & MEMORY REQUIREMENTS|11|0|$ 1.90
*CS213|STAN-CS-71-213*TARJAN,SWITCHYARD PROBLEM|33|0|$ 2.10
*CS214|STAN-CS-71-214*GRAHAM & KNUTH,COMPLEMENTS & TRANSITIVE CLOSURES|36|0|$ 1.90
*CS215|STAN-CS-71-215*MALCOLM,PL360|0|0|$ .00
*AIM147|AIM147*KLING, RESNG ANGLY W/APPLY TO HRSTC PRBLM SLOVG-THESIS|0|0|$ .00
*CS216|SAME
*AIM148|AIM-148*ASHCROFT ETAL,DCDBL PRPTS OF MONADIC FNTNL SCHEMAS|72|0|$ 2.00
*CS217|SAME
*CS218|STAN-CS-71-218*DEBRUIJN ET AL.,AVERAGE HEIGHT PLANE TREES|7|0|$ 1.90
*AIM144|AIM-144*QUAM, COMPUTER COMPARISON OF PICTURES-THESIS|16|0|$ 5.05
*CS219|SAME
*CS220|STAN-CS-71-220*STONE,DYNAMIC MEMORIES|5|0|$ 2.65
*AIM145|AIM-145*BUCHANAN ET AL, HRSTC PRGMG STDY OF THEORY FRMTN IN SCI|0|0|$ .00
*CS221|SAME
*CS222|STAN-CS-71-222*MEYERS,LINEAR REP TREE STRUCTURE|1|12|$ .00
*CS223|STAN-CS-71-223*GRAHAM,PRECEDENCE LANGUAGES(THESIS)|0|0|$ .00
*AIM146|AIM-146*ERSHOV, PARALLEL PROGRAMMING|0|0|$ 2.10
*CS224|SAME
*CS225|STAN-CS-71-225*BJORCK & GOLUB,NUMERICAL METHODS|0|0|$ .00
*CS226|STAN-CS-71-226*GEORGE,SIMPLE-PRECEDENCE TRANSLATOR|1|0|$ 4.45
*CS227|STAN-CS-71-227*GEORGE,GEMS-GRAPH EXPER META SYS(THESIS)|0|0|$ .00
*CS228|STAN-CS-71-228*KAUFMAN,FUNC MIN & AUTO THER CONTROL|4|0|$ 2.60
*CS229|STAN-CS-71-229*LEE & FORSYTHE,VARIA STUDY NONLINEAR SPLINE CURV|4|0|$ 2.35
*CS230|STAN-CS-71-230*SITES,ALGOL W REFERENCE MANUAL|17|0|$ 5.65
*CS232|STAN-CS-71-232*MOLER & STEWART,MATRIX EIGENVALUE PROBLEM|0|0|$ .00
*CS233|STAN-CS-71-233*WILNER,DECLARATIVE SEMANTIC DEFINITION(THESIS)|0|0|$ .00
*CS234|STAN-CS-71-234*GOLUB,MODIFIED EIGENVALUE PROBLEMS|0|0|$ .00
*CS236|STAN-CS-71-236*GOLUB & STYAN,NUMERICAL COMPUTATION|0|0|$ .00
*CS237|STAN-CS-71-237*VAN VOORHIS,DIVIDE-SORT-MERGE STRATEGY|0|0|$ .00
*CS238|STAN-CS-71-238*VAN VOORHIS,LOWER BOUND SORTING NETWORKS|0|0|$ .00
*CS239|STAN-CS-71-239*VAN VOORHIS,LARGE SORTING NETWORKS|0|0|$ .00
*AIM151|AIM-151*LONDON, CORRECTNESS OF 2 COMPILERS FOR LISP SUBSET|0|0|$ 2.95
*CS240|SAME
*AIM152|AIM-152*BIERMANN, INFERENCE OF TURING MACH FRM SAMP COMPUTATIONS|0|0|$ .00
*CS141|SAME
*AIM153|AIM-153*HAYES, FRAME PRBLM & RELATE PRBLM IN A.I.|0|0|$ 2.20
*CS242|SAME
*AIM154|AIM-154*MANNA ET AL, INDCTV METHOD FOR PROVE PROPERTIES OF PRGMS|0|0|$ .00
*CS243|SAME
*CS244|STAN-CS-71-244*TARJAN,PLANARITY ALGORITHM|0|0|$ .00
*AIM155|AIM-155*RYDER,HRSTC ANLS OF LRG TRES GNRAT GAME GO-THESIS|0|0|$ 10.10
*CS245|SAME
*AIM156|AIM-156*COLBY ET AL, TEST VLD OF CMPTR SIMLAT PARNOD PRCES|101|0|$ 2.50
*CS246|SAME
*AIM157|AIM-157*WILKS, ONE SMALL HEAD|0|0|$ .00
*CS247|SAME
*CS248|STAN-CS-71-248*FREDMAN & KNUTH,RECURRENCE RELATIONS|0|0|$ 2.75
*CS249|STAN-CS-71-249*POLLACK,BIBLIO CONSTRUCT COMPILERS|0|0|$ .00
*AIM158|AIM-158*CHANDRA & MANNA, PROGRAM SCHEMAS WITH EQUALITY|19|0|$ 2.05
*CS250|SAME
*CS251|STAN-CS-72-251*STONE, EFFICIENT PARALLEL ALGORITHM|0|0|$ .00
*CS252|STAN-CS-72-252*SAUNDERS,LARGE-SCALE LINEAR|0|0|$ .00
*AIM159|AIM-159*FELDMAN & SHIELDS, TTL CMPLX & INFRNCE OF BST PRGMS|11|0|$ 2.85
*CS253|SAME
*CS254|STAN-CS-72-254*FORSYTHE,VON NEUMANN'S COMPARISON METHOD|1|0|$ 2.30
*AIM160|AIM-160*FELDMAN, AUTOMATIC PROGRAMMING|0|0|$ .00
*CS255|SAME
*CS256|STAN-CS-72-256*CHVATAL,EDMONDS POLYHEDRA|3|0|$ 2.35
*CS257|STAN-CS-72-257*WIRTH,PASCAL,CODE GENERATION,CDC 6000|0|0|$ .00
*CS258|STAN-CS-72-258*BROWN,BASIC MACHINE ALGORITHMS|9|0|$ 2.15
*CS259|STAN-CS-72-259*CRANE,LINEAR LISTS (THESIS)|0|0|$ .00
*CS260|STAN-CS-72-260*PRATT,SHELLSORT & SORTING NETWORKS(THESIS)|0|0|$ .00
*CS261|STAN-CS-71-261*GOLUB & PEREYRA,DIFFERENTIATION PSEUDO-INVERSES|0|0|$ .00
*CS262|STAN-CS-72-262*STAFF,BIBLIOGRAPHY|1|0|$ .00
*CS263|STAN-CS-72-263*KLARNER & RIVEST,PROCEDURE UPPER BOUND|0|0|$ .00
*AIM161|AIM-161*WILKS, A.I. APPROACH TO MACHINE TRANSLATION|0|0|$ .00
*CS264|SAME
*AIM162|AIM-162*SCHANK ET AL, PRIMTIV CNCEPTS UNDERLYING VERBS OF THOUGHT|0|0|$ .00
*CS265|SAME
*AIM163|AIM-163*CADIOU, RCRSV DFNTNS PRTAL FNCTS & THER CMPTS-THESIS|0|0|$ 6.20
*CS266|SAME
*CS267|STAN-CS-72-267*BONZON,MPL|2|0|$ 2.50
*CS268|STAN-CS-72-268*CHVATAL,DEGREES & MATCHING|0|0|$ 2.20
*CS269|STAN-CS-72-269*KLARNER & RADO,ARITHMETIC PROPERTIES|0|0|$ .00
*CS270|STAN-CS-72-270GOLUB ET AL, LANCZOS ALGORITHM|0|0|$ .00
*CS271|STAN-CS-72-271*RIDDLE,SUPERVISORY SYSTEMS(THESIS)|0|0|$ .00
*AIM164|AIM-164*MANNA,VUILLEMIN, FXPT APRCH TO THEORY OF CMPUTN|8|0|$ 2.50
*CS272|SAME
*CS273|STAN-CS-72-273*CHVATAL & SICHLER,CHROMATIC AUTOMORPHISMS|7|0|$ 2.05
*CS274|STAN-CS-72-274*KLARNER & RADO,LINEAR COMBINATIONS|10|0|$ 2.05
*CS275|STAN-CS-72-275*KLARNER,SETS GENERATED ITERATION |5|0|$ 2.20
*CS276|STAN-CS-72-276*KAUFMAN,ALGORITHM TO SOLVE AX=BX|0|0|$ .00
*CS277|STAN-CS-72-277*ZAHN,REGION BOUNDARIES|1|0|$ 2.90
*CS278|STAN-CS-72-278*CONCUS & GOLUB,SOLUTION NON-SEPARABLE EQUATIONS|0|0|$ 2.60
*CS279|STAN-CS-72-279*OSBORNE,TOPICS IN OPTIMIZATION|0|0|$ .00
*AIM165|AIM-165*BOCHVAR, 2 PAPERS ON PARTIAL PREDICATE CALCULUS|12|0|$ 3.20
*CS280|SAME
*AIM166|AIM-166*QUAM ET AL, CMPTR INTRACTV PICT PRCSG|30|0|$ 2.85
*CS281|SAME
*AIM167|AIM-167*CHANDRA, EFFICIENT COMPILATION OF LNR RCRSV PRGRMS|15|0|$ 2.90
*CS282|SAME
*CS283|STAN-CS-72-283*STOUTMEYER,NUMERICAL IMPLEMENTATION(THESIS)|0|0|$ 5.65
*CS284|STAN-CS-72-284*CHVATAL,EDMONDS POLYHEDRA|53|0|$ 3.20
*CS285|STAN-CS-72-285*FLOYD & SMITH,LINEAR TIME TWO TAPE MERGE|11|0|$ 2.20
*CS286|STAN-CS-72-286*CHANDRA,MOSER'S PROBLEM IN 4 DIMENSIONS|5|0|$ 2.70
*AIM168|AIM-168*IGARASHI, ADMSBLY FXDPT INDCT 1ST-ODR LGC TYPD THRY|35|0|$ 2.85
*CS287|SAME
*AIM169|AIM-169*MILNER, LOGIC FOR COMPUTABLE FUNCTIONS|0|0|$ .00
*CS288|SAME
*AIM170|AIM-170*WILKS, LAKOFF ON LINGUISTICS & NATURAL LOGIC|0|0|$ .00
*CS289|SAME
*AIM171|AIM-171*SCHANK, ADVERBS & BELIEF|0|0|$ .00
*CS290|SAME
*CS291|STAN-CS-72-291*KNUTH,COMBINATORIAL LEMMAS|3|0|$ 2.35
*CS292|STAN-CS-72-292*CHVATAL ET AL,SELECTED COMBINATORIAL RESEARCH PROBLEMS|0|0|$ .00
*CS293|STAN-CS-72-293*LUKES,COMBINATORIAL SOLUTIONS(THESIS)|0|0|$ .00
*CS294|STAN-CS-72-294*SAAL & SHUSTEK,MICROPROGRAMMED IMPLEMENTATION|2|0|$ 2.30
*CS295|STAN-CS-72-295*PAIGE,BIDIAGONALIZATION OF MATRICES|0|0|$ .00
*CS296|STAN-CS-72-296*FREDMAN,RECURSIVELY DEFINED FUNCTIONS(THESIS)|1|0|$ 4.25
*CS297|STAN-CS-72-297*PAIGE,SOLVING MATRIX EQUATIONS|0|0|$ .00
*CS298|STAN-CS-72-298*KOGGE & STONE,PARALLEL ALGORITHM|0|0|$ .00
*AIM172|AIM-172*RUSSELL, SMTC CATS NMNLS CNCPTL DEPEND ANALS NAT LANG|0|0|$ .00
*CS299|SAME
*CS300|STAN-CS-72-300*KAUFMAN,COUNTEREXAMPLE TO CONJECTURE|16|0|$ 1.85
*CS301|STAN-CS-72-301*SAUNDERS,CHOLESKY FACTORIZATION|0|0|$ .00
*CS302|STAN-CS-72-302*GOLUB,USES OF LANCZOS ALGORITHM|0|0|$ .00
*AIM174|AIM-174*MORRIS, CRTNS OF TRNSLTNS OF PROGRMG LANG-THESIS|0|0|$ .00
*CS303|SAME
*CS304|STAN-CS-72-304*ANDERSSEN & GOLUB,RICHARDSON'S ITERATIVE PROCEDURE|0|0|$ .00
*AIM173|AIM-173*AGIN, RPRSNT & DESCRIP OF CRVD OBJECTS-THESIS|0|0|$ .00
*CS305|SAME
*CS306|STAN-CS-72-306*POLLACK,BIBLIO COMPUTER GRAPHICS|0|0|$ .00
*AIM175|AIM-175*TANAKA, HADAMARD TRNSFRM SPEECH WAVE ANLS|0|0|$ 2.65
*CS307|SAME
*AIM176|AIM-176*FELDMAN ET AL, RECENT DEVELOPMNTS IN SAIL|0|0|$ .00
*CS308|SAME
*CS309|STAN-CS-72-309*LESSER,DYNAMIC CONTROL STRUCTURES|15|0|$ 8.75
*CS310|STAN-CS-72-310*KAUFMAN,SCHEDULING UNIT-TIME TASKS|0|0|$ .00
*AIM177|AIM-177*PAUL, MDLG TRJCT CALCUL & SERVOG A CMPTR CNTRLD ARM-THESIS|0|0|$ .00
*CS311|SAME
*AIM178|AIM-178*GILL, VSL FDBC & RLTD PRBLM CMTR CTRLD HND EYE CORD-THESIS|0|0|$ .00
*CS312|SAME
*CS313|STAN-CS-72-313*STAFF,BIBLIOGRAPHY|0|0|$ .00
*CS314|STAN-CS-72-314*KOGGE,PARALLEL ALGORITHMS(THESIS,PART 1)|0|0|$ .00
*CS315|STAN-CS-72-315*KOGGE,NUMERICAL STABILITY(THESIS,PART 2)|0|0|$ .00
*CS316|STAN-CS-72-316*KOGGE,MINIMAL PARALELLISM(THESIS,PART 3)|0|0|$ .00
*CS317|STAN-CS-72-317*BASKETT & FULLER,DRUM STORAGE UNITS|0|0|$ .00
*CS318|STAN-CS-72-318*BROWN ET AL.,CONSTRUCTIVE GRAPH LABELING|1|0|$ .00
*CS319|STAN-CS-72-319*GOLUB & VARAH,BEST L(2) SCALING OF MATRIX|0|0|$ .00
*AIM179|AIM-179*BAUMGART, WINGED EDGE POLYHEDRON REPRESENTATION|0|0|$ .00
*CS320|SAME
*AIM180|AIM-180*BAJCSY, CMPTR I.D. OF TXTRD VISUAL SCENES-THESIS|1|0|$ .00
*CS321|SAME
*CS322|STAN-CS-72-322*GILL ET AL.,MODIFYING MATRIX FACTORIZATIONS|0|0|$ .00
*CS323|STAN-CS-72-323*MALCOLM & PALMER,TRI-DIAGONAL LINEAR SYSTEMS|0|0|$ .00
*CS324|STAN-CS-72-324*BAUER, M X N SEQUENCING PROBLEM(THESIS)|0|0|$ .00
*AIM181|AIM-181*BUCHANAN, RVU HUBERT DREYFUS' WT CMPTRS CNT DO|0|0|$ .00
*CS325|SAME
*AIM182|AIM-182*COLBY & HILF, TRNSCPT SMULTN PARANOID PROCS|1|0|$ .00
*CS326|SAME
*CS327|STAN-CS-72-327*KLARNER & RIVEST,ASYMPTOTIC BOUNDS|0|0|$ .00
*CS328|STAN-CS-72-328*GABOW,EDMOND'S MAX MATCHING ALGORITHM|0|0|$ .00
*CS329|STAN-CS-72-329*FANG,FOLDS(THESIS)|0|0|$ .00
*AIM184|AIM-184*NEWEY, AXIOMS & THRY INTGRS LSTS & FINIT SETS LCF|0|0|$ 3.30
*CS330|SAME
*AIM187|AIM-187*COLLINS, COMPUTING TIME OF THE EUCLIDEAN ALGORITHM|0|0|$ .00
*CS331|SAME
*AIM186|AIM-186*MILNER, MODELS OF LCF|0|0|$ .00
*CS332|SAME
*AIM185|AIM-185*CHANDRA & MANNA, ON THE POWER OF PROGRAMMING FEATURES|0|0|$ .00
*CS333|SAME
*CS334|STAN-CS-73-334*MALCOLM & MOLER,URAND|0|0|$ .00
*CS335|STAN-CS-73-335*GOLUB & SENETA,INFINITE MARKOV MATRIX|13|0|$ 2.05
*AIM188|AIM-188*CHANDRA, PROPERTIES & APPLICTNS OF PRGRM SCHEMAS-THESIS|0|0|$ .00
*CS336|SAME
*AIM189|AIM189*GIPS & STINY, AESTHETICS SYSTEMS|0|0|$ .00
*CS337|SAME
*CS338|STAN-CS-73-338*KLARNER,FINITE BASIS THEOREM REVISITED|0|0|$ .00
*CS339|STAN-CS-73-339*GOLUB & DENT,MAXIMUM LIKELIHOOD ESTIMATOR|0|0|$ .00
*AIM190|AIM-190*NEWEY, NTS ON PRBLM INVOLVG PRMUTNS AS SQUNCES|12|0|$ 2.25
*CS340|SAME
*AIM191|AIM-191*KATZ & MANNA, HEURISTIC APPROACH TO PRGRM VERIFY|3|0|$ 2.85
*CS341|SAME
*CS342|STAN-CS-73-342*KNUTH,MATROID PARTITIONING|0|0|$ .00
*CS343|STAN-CS-73-343*LEVINE,GERMAN GRAMMAR INSTRUCTION(THESIS)|9|0|$ 8.30
*AIM183|AIM-183*SCHANK, 14 PRIMITIVE ACTIONS & THEIR INFERENCES|0|0|$ .00
*CS344|SAME
*AIM192|AIM-192*COLLINS & HOROWITZ, MIN ROOT SEPART OF A PLYNMAL|114|0|$ 2.05
*CS345|SAME
*AIM193|AIM193*COLBY, CMPTR TRTMT LANG DFICLT NSPEKG AUTISTIC CHLD|0|0|$ 2.10
*CS346|SAME
*AIM194|AIM-194*COLBY & HILF, ANALYSIS SIMULAT PARANOID THOUGHT|113|0|$ 2.00
*CS347|SAME
*CS348|STAN-CS-73-348*PEREYA,HIGH ORDER FINITE DIFFERENCE|0|0|$ .00
*CS349|STAN-CS-73-349*BLUM ET AL.,TIME BOUNDS FOR SELECTION|0|0|$ .00
*CS350|STAN-CS-73-350*KAUFMAN,ASSEMBLY LINE SCHEDULING PROBLEM|0|0|$ 2.35
*CS351|STAN-CS-73-351*FULLER,I/O CHANNEL MULT PAGING DRUMS(THESIS)|0|0|$ .00
*CS352|STAN-CS-73-352*FULLER,DIFF SLTF & MTPT DRUM(THESIS)|7|0|$ 1.90
*CS353|STAN-CS-73-353*FULLER,MTPT DISC SCHEDULING(THESIS)|5|0|$ 1.90
*CS354|STAN-CS-74-354*KLARNER,SDR'S REGULAR SYSTEMS|14|0|$ 1.90
*CS355|STAN-CS-73-355*PRICE,CENTRAL PROCESSOR SCHEDULING|0|0|$ .00
*AIM195|AIM-195*SMITH & ENEA, MLISP2|0|0|$ 4.25
*CS356|SAME
*AIM196|AIM-196*GOLDMAN & RIESBECK, CNCPTULY BASED SENTENCE PRAPHRSR|0|0|$ .00
*CS357|SAME
*AIM197|AIM-197*SCHANK & RIEGER, INFRNCE & CMPTR UDRSTNDG NAT LANG|0|0|$ .00
*CS358|SAME
*CS359|STAN-CS-73-359*STONE,COMBINATORIAL PROBLEM|1|0|$ 1.90
*CS360|STAN-CS-73-360*MUNTZ & BASKETT,OPEN, CLOSED & MIXED NETWORKS|1|0|$ 2.90
*CS361|STAN-CS-73-361*BROWN & MASINTER,ALGORITHM ORGANIC MOLECULES|2|0|$ 2.45
*CS362|STAN-CS-73-362*PRINTED AS STAN-CS-73-398|0|0|$ .00
*CS363|STAN-CS-73-363*KAUFMAN,LZ ALGORITHM(THESIS)|0|0|$ .00
*AIM198|AIM-198*THOSAR, ESTMA DNSTY USE SIG TABL APPLY PAT RECOG|66|0|$ 2.75
*CS364|SAME
*AIM200|AIM-200*IGARASHI ET AL, AUTOMATIC PROGRAM VERIFICATION I|0|286|$ .00
*CS365|SAME
*AIM201|AIM-201*GRAPE, MODEL BASED COMPUTER VISION-THESIS|0|0|$ .00
*CS366|SAME
*CS367|STAN-CS-73-367*AMBLE & KNUTH,ORDERED HASH TABLES|0|0|$ .00
*AIM202|AIM-202*SCHANK & WILKS, GOALS OF LINGUISTIC THEORY REVISITED|0|0|$ .00
*CS368|SAME
*AIM203|AIM-203*SCHANK, DEVELOPMENT OF CONCEPTUAL STRUCTURES IN CHILD|0|0|$ .00
*CS369|SAME
*AIM205|AIM-205*SRIDHARAN ET AL, HRSTC PRGRM FOR CMPLX ORGNC MLCULS|0|0|$ .00
*CS370|SAME
*CS371|STAN-CS-73-371*KNUTH,REVIEW "STRUCTURED PROG"|24|0|$ 2.45
*CS372|STAN-CS-73-372*MALCOLM,NONLINEAR SPLINE FUNCTIONS(THESIS EXC.)|0|0|$ .00
*AIM204|AIM-204*VANLEHN, SAIL USERS MANUAL|0|0|$ 5.10
*CS373|SAME
*CS374|STAN-CS-73-374*MALCOLM,FLOATING-POINT SUMMATION(THESIS EXC.)|0|0|$ .00
*CS375|STAN-CS-73-375*FISCHER ET AL.,FOURIER-TOEPLITZ METHODS|0|0|$ .00
*CS376|STAN-CS-73-376*MEINARDUS & TAYLOR,BEST UNIFORM APPROXIMATION|20|0|$ 2.30
*AIM206|AIM-206*WILKS, PREFERENCE SEMANTICS|38|0|$ 2.25
*CS377|SAME
*AIM207|AIM-207*MOORER, OPTIMUM-COMB METHOD PITCH ANALYSIS|126|0|$ 2.40
*CS378|SAME
*AIM208|AIM-208*MOORER, HETERODYNE METHOD ANALYSIS WAVEFORMS|119|0|$ 2.40
*CS379|SAME
*AIM209|AIM-209*YAKIMOVSKY, SCNE ANAL USE SEMNTC BASE RGN GROW-THESIS|0|0|$ .00
*CS380|SAME
*CS381|STAN-CS-73-381*SRIDHARAN,COMP GENERATION VERTEX-GRAPHS|1|0|$ 2.20
*AIM210|AIM-210*MANNA & PNUELI, AXMTC APRCH TO CORRECT PRGRM|55|0|$ 2.40
*CS382|SAME
*AIM211|AIM-211*WILKS, NATURAL LANGUAGE INFERENCE|50|0|$ .00
*CS383|SAME
*AIM212|AIM-212*HERSKOVITS, GNRTN OF FRENCH FRM SEMANTIC REPSENT|0|0|$ .00
*CS384|SAME
*AIM213|AIM-213*THOSAR, RECOGNITION OF CONTINUOUS SPEECH|55|0|$ 2.75
*CS385|SAME
*AIM214|AIM-214*PERKINS & BINFORD, CRNR FNDR FOR VSAL FDBK|0|0|$ 3.35
*CS386|SAME
*AIM215|AIM-215*BUCHANAN & SRIDHARAN, ANLS OF BEHAV OF CHEM MOLCLS|0|0|$ 2.15
*CS387|SAME
*CS388|STAN-CS-73-388*SWANSON,UNSCRAMBLE (P)-ORDERED VECTORS|2|0|$ 3.40
*AIM216|AIM-216*MASINTER ET AL, APPLY OF A.I. FOR CHEM INFERENCE|0|0|$ .00
*CS389|SAME
*CS390|STAN-CS-73-390*GIPS,INVERSE TURING MACHINE|2|0|$ 1.90
*AIM217|AIM-217*SRIDHARAN, SRCH STRTGES TSK ORGNC CHEM SYNTHESIS|0|0|$ .00
*CS391|SAME
*CS392|STAN-CS-73-392*KNUTH,SORTING & SEARCHING-ERR. & ADD.|61|0|$ 2.60
*AIM218|AIM-218*VUILLEMIN, PROOF TECHNIQUES FOR RECURSIVE PRGRM-THESIS|0|0|$ .00
*CS393|SAME
*AIM219|AIM-219*HOARE, PARALLEL PROGRAMMING|0|0|$ .00
*CS394|SAME
*CS395|STAN-CS-73-395*STAFF,BIBLIOGRAPHY|0|0|$ .00
*AIM220|AIM220*BOLLES & PAUL,THE USE OF SENSORY FEEDBACK...SYSTEMS|0|0|$ 2.45
*CS396|SAME
*CS397|STAN-CS-73-397*HENRICI,COMPUTATIONAL ANALYSIS|0|0|$ .00
*AIM199|AIM-199*BAUMGART, IMAGE CONTOURING & COMPARING|0|0|$ 3.15
*CS398|SAME
*CS399|STAN-CS-73-399*PAIGE & SAUNDERS,SOLUTION SPARSE INDEF SYSTEMS|0|0|$ .00
*AIM223|AIM-223*HOARE, RECURSIVE DATA STRUCTURES|0|0|$ 2.70
*CS400|SAME
*CS401|STAN-CS-74-401*HOARE,MONITORS:STRUCTURING CONCEPT|0|0|$ .00
*CS402|STAN-CS-74-402*HERRIOT & REINSCH,QUINTIC SPLINE FUNCTIONS|0|0|$ .00
*AIM224|AIM-224*HOARE, HINTS ON PROGRAMMING LANGUAGE DESIGN|0|224|$ .00
*CS403|SAME
*CS404|STAN-CS-74-404*SRIDHARAN,QUADRI/TRIVALENT GRAPHS|0|0|$ .00
*CS405|STAN-CS-76-405*DAVIS & WRIGHT,STANFORD CSD RESEARCH REPORT|0|0|$ .00
*AIM225|AIM-225*PERKINS, MOMORY MODEL FOR A ROBOT|0|291|$ .00
*CS406|SAME
*AIM226|AIM-226*WRIGHT & GORIN, FAIL|0|124|$ 3.40
*CS407|SAME
*AIM227|AIM-227*THOMAS & BINFORD, INFO PRCSG ANALS VSUL PRECPT|0|247|$ 3.10
*CS408|SAME
*AIM228|AIM-228*EARNEST, FINAL RPT:1ST 10YRS AI RSRCH AT STANFORD|0|238|$ 5.25
*CS409|SAME
*CS410|STAN-CS-74-410*PETERSON,MODELLING PARALLEL SYSTEMS(THESIS)|0|0|$ 3.10
*AIM229|AIM-229*ANDERSON ET AL, AFTER LEIBNIZ...|0|240|$ 3.00
*CS411|SAME
*AIM230|AIM-230*SWINEHART, COPILOT-THESIS|0|242|$ .00
*CS412|SAME
*AIM231|AIM-231*GIPS, SHAPE GRAMMARS & THEIR USES|0|246|$ .00
*CS413|SAME
*AIM232|AIM-232*BAUMGART, GEOMED-GEOMETRIC EDITOR|0|239|$ .00
*CS414|SAME
*CS415|STAN-CS-74-415*RIVEST,ASSOCIATIVE RETRIEVAL ALGORITHMS|0|0|$ .00
*CS416|STAN-CS-74-416*KNUTH,STRUCTURED PROGRAMMING "GO TO"|0|0|$ .00
*CS417|STAN-CS-74-417*SITES,PROVING CLEAN TERMINATION|0|0|$ .00
*CS418|STAN-CS-74-418*SITES,PROVING COMPUTER PROGRAMS TERMINATE CLEANLY|0|0|$ .00
*AIM233|AIM-233*RIEGER,CONCEPTUAL MEMORY-THESIS|0|234|$ .00
*CS419|SAME
*CS420|STAN-CS-74-420*WAKERLY,PARTIALLY SELF-CHECKING CIRCUITS|0|0|$ .00
*CS421|STAN-CS-74-421*WAKERLY,LOW-COST ERROR DETECTION(THESIS)|0|0|$ .00
*CS422|STAN-CS-74-422*STONE,PARALLEL TRIDIAG EQUATION SOLVERS|0|0|$ .00
*CS423|STAN-CS-74-423*RAO,ASYMPTOTIC REPRESENTATION|0|0|$ .00
*CS424|STAN-CS-74-424*SCHLUMBERGER,LOGARITHMIC COMMUN (THESIS,PT 1)|0|0|$ .00
*CS425|STAN-CS-74-425*SCHLUMBERGER,DEBRUIJN COMM NETS(THESIS,PT 2)|0|0|$ .00
*CS426|STAN-CS-74-426*SCHLUMBERGER,QUEUING MESSAGES(THESIS,PT 3)|0|0|$ .00
*CS427|STAN-CS-74-427*LANG,PERFECT SHUFFLE ARRAY COMP(THESIS EXC)|0|0|$ .00
*CS428|STAN-CS-74-428*LANG,SHUFFLE-EXCHANGE NETWORK(THESIS EXC)|0|0|$ .00
*CS429|STAN-CS-74-429*ORCUTT,DATA ROUTING SCHEMES(THESIS EXC)|0|0|$ .00
*CS430|STAN-CS-74-430*ORCUTT,COMPUTER ARCHITECTURE(THESIS EXC)|0|0|$ .00
*AIM234|AIM-234*COLBY ET AL, PTRN-MTCHG RULE FOR RECOG NAT LANG EXPR|0|233|$ .00
*CS431|SAME
*AIM235.1|AIM-235.1*WEYHRAUCH, A USER'S MANUAL FOR "FOL"|83|160|$ 3.30
*CS432.1|SAME
*AIM235|AIM-235*WEYHRAUCH & THOMAS, FOL: PRF CHK 1ST ORDR LGC|61|275|$ 3.30
*CS432|SAME
*AIM236|AIM-236*BUCHANAN & LUCKHAM, AUTOING CNSTRCTN OF PRGRMS|0|98|$ .00
*CS433|SAME
*CS434|STAN-CS-74-434*RUHE & WEDIN,SEPARABLE NONLINEAR LEAST SQUARES|10|0|$ .00
*CS435|STAN-CS-74-435*PRICE,BALANCED COMPUTER SYSTEMS|0|0|$ .00
*AIM237|AIM-237*WILKS,NATURAL LANGUAGE UNDERSTANDING SYSTEMS..PARADIGM|42|263|$ 2.85
*CS436|SAME
*AIM238|AIM-238*RIESBECK, COMPUTATIONAL UNDERSTANDING-THESIS|0|265|$ 9.05
*CS437|SAME
*AIM239|AIM-239*HANNAH, CMPTR MTCHG OF AREAS IN STERO IMGS-THESIS|25|279|$ 4.70
*CS438|SAME
*CS439|STAN-CS-74-439*COTTLE ET AL.,LINEAR COMPLEMENTARITY PROBS|0|0|$ .00
*CS440|STAN-CS-74-440*MORRIS ET AL,FAST PATTERN MATCHING|0|0|$ .00
*CS441|STAN-CS-441*KNUTH & MOORE,ALPHA-BETA PRUNING|0|0|$ .00
*CS442|STAN-CS-74-442*KNUTH, ESTIMATING EFFICIENCY|0|0|$ .00
*CS443|STAN-CS-74-443*BROTZ,HEURISTIC PROB SOLVING METHODS(THESIS)|0|128|$ .00
*AIM240|AIM-240*GREEN ET AL, PRGRS RPT ON PRGRM-UNDRSTNDG SYS|0|275|$ 3.10
*CS444|SAME
*CS445|STAN-CS-74-445*FRIEDMAN ET AL.,FINDING NEAREST NEIGHBORS|0|0|$ .00
*AIM241|AIM-241*AIELLO & WEYHRAUCH, LCFSMALL|29|296|$ 2.95
*CS446|SAME
*AIM221|AIM-221*AIELLO ET AL, SEMANTICS OF PASCAL IN LCF|0|294|$ .00
*CS447|SAME
*CS448|STAN-CS-74-448*GOLDFARB,MATRIX FACTORIZATION|55|0|$ .00
*CS449|STAN-CS-74-449*SMITH,PERFORMANCE ANALYSIS(THESIS)|0|0|$ .00
*CS450|STAN-CS-74-450*BASKETT & SMITH,MULTIPROCESSOR COMP SYS (THESIS EXC)|0|0|$ .00
*CS451|STAN-CS-74-451*SMITH,SET PAGING ALGORITHM(THESIS EXC)|0|0|$ .00
*AIM242|AIM-242*LOW, AUTOMATIC CODING-THESIS|0|281|$ .00
*CS452|SAME
*CS453|STAN-CS-74-453*KNUTH,RANDOM MATROIDS|40|0|$ 2.60
*CS454|STAN-CS-74-454*JENNINGS,SIMULTANEOUS ESTIMATION|22|0|$ 2.15
*CS455|STAN-CS-74-455*TARJAN,EDGE-DISJOINT SPANNING TREES|3|0|$ 2.90
*AIM243|AIM-243*FINKEL ET AL, AL-PRGRMG SYS FOR AUTO|0|285|$ .00
*CS456|SAME
*AIM244|AIM-244*COLBY, 10 CRITICISMS OF PARRY|0|246|$ 1.90
*CS457|SAME
*AIM245|AIM-245*BUCHANAN, STUDY IN AUTOMATIC PROGRAMMING-THESIS|0|274|$ .00
*CS458|SAME
*AIM246|AIM-246*WINOGRAD, 5 LECTURES ON A.I.|80|227|$ 2.60
*CS459|SAME
*CS460|STAN-CS-74-460*PORTER & SIMON, RANDOM INSERTION|63|0|$ 2.45
*AIM247|AIM-247*GOLDMAN, CPTR GENR NAT LANG DEP CNCPT BAS-THESIS|0|275|$ 11.25
*CS461|SAME
*AIM248|AIM-248*PINGLE & THOMAS, FST FETUR-DRVN STERO DPTH PRGRM|44|296|$ 2.15
*CS462|SAME
*AIM249|AIM-249*BAUMGART, GEOMTRC MDLG FOR CMPTR VSN-THESIS|0|229|$ 5.65
*CS463|SAME
*AIM250|AIM-250*DSCRPT CMPLX CRVD OBJTS RECOG & VSUL MMRY-THESIS|0|281|$ 5.50
*CS464|SAME
*AIM251|AIM-251*SHORTLIFFE, MYCIN-THESIS|0|274|$ .00
*CS465|SAME
*AIM252|AIM-252*EARNEST, RSRCH IN AI, HRSTC PRGRMG & NTWRK PRTCL|0|244|$ 3.80
*CS466|SAME
*AIM222|AIM-222*AIELLO,WEYHRAUCH, CHK PRFS METAMATH 1STORDR LGC|77|297|$ 3.25
*CS467|SAME
*CS468|STAN-CS-74-468*KROGDAHL,COMBINATORIAL BASE|32|0|$ 2.45
*CS469|STAN-CS-74-469*BROWN,MOLECULAR STRUCTURE ELUCIDATION|28|0|$ 2.80
*CS470|STAN-CS-74-470*TRABB PARDO,STABLE SORTING & MERGING|0|0|$ .00
*AIM253|AIM-253*FAUGHT ET AL, AFTS & INTNTNS IN MDL OF PARANOIA|76|295|$ 2.75
*CS471|SAME
*AIM254|AIM-254*QUAM & HANNAH, STANFORD AUTO PHOTOGRMETRY RSRCH|56|297|$ 2.15
*CS472|SAME
*AIM255|AIM-255*SUZUKI, AUTOMATIC PROGRAM VERIFICATION II|0|246|$ 2.50
*CS473|SAME
*AIM256|AIM-256*V.HENKE & LUCKHAM, AUTO PROGRAM VERIFICATION III|0|287|$ .00
*CS474|SAME
*AIM257|AIM-257*NEWEY, FRML SMNTS LISP W/APLY TO PRGRM CRT-THESIS|0|284|$ 7.25
*CS475|SAME
*AIM258|AIM-258*GREEN & BARSTOW, HYPTCL DIAL FOR PRGRM-UDRSTDG SYS|0|288|$ .00
*CS476|SAME
*CS477|STAN-CS-75-477*CHVATAL & SANKOFF,TWO RANDOM SEQUENCES|10|0|$ 2.20
*CS478|STAN-CS-75-478*GOLUB & WILKINSON,ILL-CONDITIONED EIGENSYSTEMS|0|0|$ .00
*CS479|STAN-CS-75-479*CHATELIN & LEMORDANT,ERROR BOUNDS IN EIGENVALUES|2|0|$ 2.40
*CS480|STAN-CS-75-480*KNUTH,GENERALIZED DEDEKIND SUMS|0|0|$ .00
*CS481|STAN-CS-75-481*OLIGER,INITIAL-BOUNDARY VALUE PROBLEM|26|0|$ .00
*CS482|STAN-CS-75-482*FRIEDMAN ET AL,ALGORITHM FOR FINDING BEST MATCHES|0|0|$ .00
*CS483|STAN-CS-75-483*ERDOS & GRAHAM,PACKING SQUARES WITH EQUAL SQUARES|12|0|$ 1.90
*CS484|STAN-CS-75-484*GRAHAM & SZEMEREDI,SUBGRAPH NUMBER INDEPENDENCE|9|0|$ 2.20
*CS485|STAN-CS-75-485*ERDOS & SZEMEREDI,MULTIPLICATIVE REPRESENTATIONS|36|0|$ 2.20
*CS486|STAN-CS-75-486*BJORCK & GOLUB,EIGENPROBLEMS FOR MATRICES|0|0|$ 2.30
*CS487|STAN-CS-75-487*FRIEDMAN,VARIABLE METRIC DECISION|27|0|$ 2.70
*CS488|STAN-CS-75-488*BOLLOBAS ET AL.,R-CHROMATIC GRAPHS|42|0|$ 2.20
*CS489|STAN-CS-75-489*SZEMEREDI,REGULAR PARTITIONS OF GRAPHS|47|0|$ 1.90
*CS490|STAN-CS-75-490*GOSPER,NUMERICAL EXPERIMENTS|25|0|$ 2.60
*CS491|STAN-CS-75-492*KNOTT,DELETION BINARY STOR TREES (THESIS)|0|0|$ .00
*CS492|STAN-CS-75-492*SEDGEWICK,QUICKSORT|0|0|$ .00
*CS493|STAN-CS-75-493*KURKI-SUONIO,DESCRIBING AUTOMATA|9|0|$ 2.80
*CS494|STAN-CS-75-494*SATTERTHWAITE,SOURCE LANG DEBUGGING TOOLS|0|0|$ .00
*CS495|STAN-CS-75-495*KROGDAHL,DEPENDENCE GRAPH|27|0|$ 2.60
*CS496|STAN-CS-75-496*UNDERWOOD,ITERAIVE BLOCK LANCZOS(THESIS)|0|0|$ 5.70
*CS497|STAN-CS-75-497*GRAHAM & LOVASZ,DISTANCE MATRICES OF TREES|40|0|$ 3.10
*AIM259|AIM-259*SAMET, AUTO PRVG CRCT TRNSLATNS INVLV CODE-THESIS|0|288|$ 7.70
*CS498|SAME
*AIM260|AIM-260*SMITH, PYGMALION-THESIS|0|284|$ .00
*CS499|SAME
*CS500|STAN-CS-75-500*KURKI-SUONIO,TOWARDS BETTER DEFINITIONS|0|0|$ .00
*AIM261|AIM-261*PETTERSEN, PROCDRAL EVNTS AS SOFTWARE INTERRUPTS|54|295|$ 1.95
*CS501|SAME
*AIM262|AIM-262*PETTERSEN, SYNCHRONIZATION OF CONCURRENT PROCES|37|0|$ 2.10
*CS502|SAME
*AIM263|AIM-263*PETTERSEN, MACRO PROCESSING SYSTEM STAGE2|106|298|$ 2.25
*CS503|SAME
*CS504|STAN-CS-75-504*SZEMEREDI,ON SPARSE GRAPHS WITH PATHS|22|0|$ 1.85
*CS505|STAN-CS-75-505*CHVATAL,LINEAR PROGRAMMING ASPECTS|7|0|$ 2.60
*AIM264|AIM-264*GORDON, OPERATION REASON & DENOTATION SEMANTICS|89|291|$ 2.65
*CS506|SAME
*AIM265|AIM-265*GORDON, TWRDS SEMANTIC THEORY DYNAMIC BINDG|102|294|$ 2.50
*CS507|SAME
*CS508|STAN-CS-75-508*EVE,TRANSITIVE CLOSURE RELATION|2|0|$ 1.85
*CS509|STAN-CS-75-509*OVERTON & PROSKUROWSKI,FIND MAXIMAL INCIDENCE|32|0|$ 3.90
*CS510|STAN-CS-75-510*YAO & KNUTH,ANALYSIS OF SUBTRACTIVE ALGORITHMS|88|0|$ 2.00
*CS511|STAN-CS-75-511*DUBOST & TROUSSE,SOFTWARE IMPLEMENTATION|4|0|$ 2.75
*CS512|STAN-CS-75-512*TARJAN,APPLICATIONS PATH COMPRESSION|0|0|$ .00
*CS513|STAN-CS-75-513*BENTLEY,FIXED RADIUS NEAR NEIGHBOR SEARCHING|29|0|$ 2.60
*CS514|STAN-CS-75-514*TOKURA,MICROPROGRAM CONTROL UNIT|0|0|$ .00
*CS515|STAN-CS-75-515*BRENT,MULTIPLE-PRECISION EVALUATION|13|0|$ 2.35
*CS516|STAN-CS-75-516*STOER,QUADRATIC TERMINATION & CONVERGENCE PROPERTIES|0|0|$ .00
*CS517|STAN-CS-75-517*CHVATAL & THOMASSEN, DISTANCES OF GRAPHS|0|0|$ .00
*CS518|STAN-CS-75-518*CHVATAL & HAMMER,AGGREGATION OF INEQUALITIES|15|0|$ 2.50
*AIM266|AIM-266*DAVIS ET AL, RULES KNLDG-BASE CONSULT PRGRM|116|288|$ 2.75
*CS519|SAME
*AIM267|AIM-267*V.HENKE, DATA STRUCTURES IN LCF|287|296|$ 2.85
*CS520|SAME
*AIM268|AIM-268*THOMPSON, DEPTH PERCEPTION STEREO CMPTR VSN|213|296|$ 2.15
*CS521|SAME
*AIM269|AIM-269*LUCKHAM ET AL, AUTO PROGRAM VERIFICATION IV|168|295|$ 2.50
*CS522|SAME
*AIM270|AIM-270*REISER, BAIL|0|288|$ 2.45
*CS523|SAME
*AIM271|AIM-271*DAVIS & KING, OVERVIEW OF PRODUCTION SYSTEMS|40|232|$ 2.85
*CS524|SAME
*AIM272|AIM-272*GANAPATHY, SCENES CONTAINING POLYHEDRA-THESIS|0|100|$ 7.40
*CS525|SAME
*CS526|STAN-CS-75-526*TARJAN,GRAPH THEORY|0|0|$ .00
*CS527|STAN-CS-75-527*MCCLUSKEY ET AL.,CURRENT RES CEN RELIABLE COMP|0|0|$ .00
*CS528|STAN-CS-75-528*TARJAN,SOLVING PATH PROBLEMS ON DIRECTED GRAPHS|0|0|$ .00
*CS529|STAN-CS-75-529*BENTLEY & FRIEDMAN,FAST ALGORITHMS|8|0|$ 2.60
*CS530|STAN-CS-75-530*LENTINI & PEREYRA,DIFFERENCE SOLVER BOUNDARY PROBLEMS|1|0|$ 3.00
*CS531|STAN-CS-75-531*ROSE & TARJAN,ALGORITHMIC ASPECTS VERTEX ELIMINATION|0|0|$ .00
*CS532|STAN-CS-75-532*JACOBS,BIBLIOGRAPHY CSD TECH REPORTS|324|0|$ .00
*CS533|STAN-CS-75-533*CONCUS ET AL.,GENERAL CONJ GRAD METHOD|8|0|$ 2.40
*AIM273|AIM-273*HEMPHILL, SPRCH TO AUTO LANG UNDRSTD & BLF-THESIS|0|284|$ .00
*CS534|SAME
*CS535|STAN-CS-76-535*CONCUS & GOLUB, GENERALIZED CONJUGATE GRADIENT |1|0|$ 2.05
*AIM274|AIM-274*GROSSMAN & TAYLOR, GNRTN OBJCT MDLS W/MANIPLATR|210|293|$ 2.60
*CS536|SAME
*AIM275|AIM-275*BOLLES, VSN WITHIN PRGRMBL ASSY SYS|68|296|$ 4.00
*CS537|SAME
*CS538|STAN-CS-75-538*KNUTH & TRABB PARDO,ANALYSIS OF FACTORIZATION ALGORITHM|67|0|$ 3.00
*AIM276|AIM-276*MANNA & SHAMIR, NEW APRCH TO RECURSIVE PRGRMS|141|295|$ 2.40
*CS539|SAME
*CS540|STAN-CS-76-540*GRAHAM ET AL.,ADDITION CHAINS|35|0|$ 1.90
*CS541|STAN-CS-76-541*KNUTH,MATH & COMPUTER SCIENCE:COPING WITH FINITENESS|0|0|$ .00
*AIM277|AIM-277*MANNA & SHAMIR, THEORY ASPECTS  OF OPTIMAL FXDPT|0|284|$ 2.45
*CS542|SAME
*CS543|STAN-CS-76-543*ZAVE,OPTIMAL POLYPHASE SORTING|0|0|$ .00
*CS544|STAN-CS-76-544*MONT-REYNAUD,REMOVING TRIVIAL ASSIGNMENTS|0|0|$ .00
*CS545|STAN-CS-76-545*PAUL,TARJAN & CELONI,SPACE BOUNDS|52|0|$ 2.35
*CS546|STAN-CS-76-546*BASKETT & SHUSTEK,VIDEO GRAPHICS TERMINAL|11|0|$ 2.45
*CS547|STAN-CS-76-547*TARJAN,ITERATIVE ALGORITHMS FOR GLOBAL FLOW ANALYSIS|43|0|$ 2.60
*CS548|STAN-CS-76-548*O'LEARY,HYBRID CONJUGATE GRAD ALGORITHMS|0|0|$ .00
*AIM278|AIM-278*LUCKHAM & SUZUKI, AUTO PRGRM VERIFICATION V|121|289|$ 3.05
*CS549|SAME
*CS550|STAN-CS-76-550*TARJAN & TROJANOWSKI,FINDING MAX INDEPENDENT SET|54|0|$ 2.35
*CS551|STAN-CS-76-551*KNUTH,STATE OF ART OF COMPUTER PROGRAMMING|0|0|$ 3.40
*AIM279|AIM-279*SUZUKI, AUTO VRFCT PRGRM W/CMPLX DATA-THESIS|0|267|$ 7.15
*CS552|SAME
*CS553|STAN-CS-76-553*TARJAN,COMPLEXITY OF MONOTONE NETWORKS|24|0|$ 2.35
*CS554|STAN-CS-76-554*YU,MODELING WRITE BEHAVIOR(THESIS)|6|0|$ 7.25
*AIM280|AIM-280*GROSSMAN,TOLERANCING IN DISCR PARTS MFG & ASSEMBLY|359|242|$ 2.40
*CS555|SAME
*CS556|STAN-CS-76-556*GUIBAS,ANALYSIS OF HASHING ALGORITHMS(THESIS)|221|172|$ 5.55
*CS557|STAN-CS-76-557*PATERSON,INTRO TO BOOLEAN FUNCTION COMPLEXITY|0|174|$ 2.25
*AIM281.1|AIM-281.1*MANNA & WALDINGER, IS `SOMETIME' SOMETIMES BETTER?|177|76|$ 2.85
*CS558|SAME
*CS559|STAN-CS-76-559*GOLUB ET AL,RANK DEGENERACY AND LEAST SQUARES|0|189|$ 2.75
*AIM282|AIM-282*TAYLOR,SYNTHESIS OF MANIPULATOR CNTRL PROGRMS(THESIS)|128|477|$ 8.10
*CS560|SAME
*CS561|STAN-CS-76-561*WOODS,MATH PROG LANGUAGE: USER'S GUIDE|12|192|$ .00
*CS562|STAN-CS-76-562*KNUTH,TRABB PARDO,EARLY DEVEL OF PROG LANGUAGES|3|172|$ 3.50
*CS563|STAN-CS-76-563*RUSSELL,STATE RESTORATION|0|0|$ .00
*AIM283|AIM-283*DAVIS,APPL OF META KNOWLEDGE TO LARGE KNOWLG BASES(THESIS)|0|261|$ .00
*CS564|SAME
*CS565|STAN-CS-76-565*STRIKWERDA,BOUNDARY VALUE PROBLEMS(THESIS)|7|518|$ .00
*CS566|STAN-CS-76-566*WRIGHT,NUMERICAL METHODS(THESIS)|0|454|$ .00
*AIM284|AIM-284*FINKEL,CONSTRUCT & DEBUG MANIPULATOR PROGRAMS-THESIS|4|227|$ .00
*CS567|SAME
*AIM285|AIM-285*BINFORD ET AL,EXPLOR STDY ASSY SYS,PRGRS RPT 3|0|200|$ .00
*CS568|SAME
*AIM285.4|AIM-285.4*BINFORD ET AL,EXPLOR STDY ASSY SYS,PRGRS RPT 4|153|71|$ 11.80
*CS568.4|SAME
*CS569|STAN-CS-76-569*HERRIOT,INTERPOLATING NATURAL SPLINE FUNCTIONS|149|214|$ 3.10
*AIM286|AIM-286*LENAT, AM: A.I. APPROACH TO DISCOVERIN IN MATH-THESIS|0|276|$ .00
*CS570|SAME
*AIM287|AIM-287*RODERICK, DISCRETE CONTROL OF A ROBOT ARM-THESIS|87|200|$ 4.45
*CS571|SAME
*AIM288|AIM-288*FILMAN, WEYHRAUCH, FOL PRIMER|0|166|$ 2.70
*CS572|SAME
*CS573|STAN-CS-76-573*JONASSEN,STATIONARY P-TREE FOREST|118|226|$ 4.40
*AIM289|AIM-289*REISER, SAIL|119|73|$ 6.70
*CS574|SAME
*AIM290|AIM-290*SMITH, SAIL TUTORIAL|104|125|$ 3.20
*CS575|SAME
*CS576|STAN-CS-76-576*MCDIARMID,CHROMATIC NUMBER OF A GRAPH|82|211|$ 3.55
*AIM291|AIM-291*BUCHANAN ET AL, 3 REVUS WEIZENBAUM'S CMPTR PWR & RSNG|0|71|$ 2.50
*CS577|SAME
*CS578|STAN-CS-76-578*OLIGER & SUNDSTROM,INITIAL-BOUNDARY PROBLEMS|21|497|$ 3.45
*CS579|STAN-CS-76-579*BASKETT & RAFII,A0 INVERSION MODEL|204|211|$ 2.60
*AIM292|AIM-292*WINOGRAD, TWRDS PROCEDURAL UNDRSTNDG OF SEMANTICS|0|58|$ 2.55
*CS580|SAME
*AIM293|AIM-293*BOBROW & WINOGRAD, OVERVIEW OF KRL|0|27|$ 2.85
*CS581|SAME
*CS582|STAN-CS-76-582*CHVATAL ET AL.,RESULTS CONCERN MULTICOLORING|83|219|$ 1.95
*CS583|STAN-CS-76-583*CHVATAL,DETERMINING STABILITY NUMBER|51|213|$ 2.80
*CS584|STAN-CS-76-584*KNUTH,DELETIONS THAT PRESERVE|3|151|$ 2.60
*CS585|STAN-CS-76-585*CONCUS ET AL.,NUMERICAL SOLUTION|0|127|$ .00
*AIM294|AIM-294*DERSHOWITZ & MANNA, EVOLUTION OF PROGRAMS|119|91|$ 2.95
*CS586|SAME
*CS587|STAN-CS-77-587*GAREY ET AL.,COMPLEXITY RESULTS|63|183|$ 2.70
*CS588|STAN-CS-77-588*CHAN,SINGULAR VALUE DECOMPOSITION|0|116|$ .00
*P772|HPP-77-2*ENGELMORE & NII,KNOWLEDGE-BASED SYSTEM|88|189|$ 2.70
*CS589|SAME
*CS590|STAN-CS-77-590*KNUTH & PATERSON,PARTITION INVOLUTIONS|7|113|$ 2.35
*AIM295|AIM-295*BOLLES, VERIFY VISION W/PRGRM ASSEMBLY SYS-THESIS|11|164|$ 8.55
*CS591|SAME
*AIM296|AIM-296*CARTWRIGHT, FORML DEMNT DEF & VER SYS LISP-THESIS|58|91|$ 6.15
*CS592|SAME
*P771|HPP-77-1*SCOTT ET AL.,EXPLANATION CAPABILITIES|0|43|$ 2.55
*CS593|SAME
*CS594|STAN-CS-77-594*STRITTER,FILE MIGRATION(THESIS)|7|10|$ 4.85
*CS595|STAN-CS-77-595*LEWIS,SPARSE MATRIX EIGENVALUE(THESIS)|0|93|$ 4.85
*P775|HPP-77-5*STEFIK & MARTIN,KNOWLDGE BASED PROBLEM SOLVING|22|67|$ 4.40
*CS596|SAME
*P776|HPP-77-6*BUCHANAN & MITCHELL,MODEL-DIRECTED LEARNING|42|51|$ 2.30
*CS597|SAME
*CS598|STAN-CS-77-598*JONASSEN & KNUTH,TRIVIAL ALGORITHM|1|0|$ 2.60
*CS599|STAN-CS-77-599*KNUTH & SCHONHAGE,EXPECTED LINEARITY|10|32|$ 3.30
*CS600|STAN-CS-77-600*BROWN,ANALYSIS OF PRIORITY QUEUE(THESIS)|0|37|$ 4.55
*CS601|STAN-CS-77-601*REISER,RANDOM NUMBER GENERATORS(THESIS)|0|66|$ 2.65
*CS602|STAN-CS-77-602*DE BOOR & GOLUB,NUMERICALLY STABLE RECONSTRUCTION|0|23|$ .00
*CS603|STAN-CS-77-603*TARJAN,REFERENCE MACHINES|45|72|$ 2.95
*CS604|STAN-CS-77-604*CHAN & OLIGER,CONTROL OF DISSIPATIVITY|0|62|$ 1.24
*P7714|HPP-77-14*SMITH ET AL.,MODEL LEARNING SYSTEMS|0|127|$ 2.30
*CS605|SAME
*CS606|STAN-CS-77-606*CLANCY & KNUTH,PROGRAMMING SEMINAR|0|2|$ 4.60
*CS607|STAN-CS-77-607*OWICKI,SPECIFICATIONS & PROOFS|68|88|$ 2.45
*CS608|STAN-CS-77-608*SIMON,SUBRECURSIVE REDUCIBILITIES(THESIS)|0|176|$ .00
*CS609|STAN-CS-77-609*TARJAN,COMBINATORIAL ALGORITHMS|0|75|$ 4.15
*AIM297|AIM-297*WINOGRAD, FRAMEWORK FOR UNDERSTANDING DISCOURSE|0|35|$ 2.40
*CS610|SAME
*AIM298|AIM-298*MANNA & WALDINGER, LOGIC OF COMPUTER PROGRAMMING|71|15|$ 4.25
*CS611|SAME
*P777|HPP-77-7*NII & FEIGENBAUM,RULE-BASED UNDERSTANDING|95|175|$ 2.35
*CS612|SAME
*CS613|STAN-CS-77-613*SPEDICATO,QUASI-NEWTON METHODS|159|178|$ 2.60
*AIM299|AIM-299*MANNA & SHAMIR, CONVERG FUNCTIONS TO FIXEDPOINTS|98|155|$ 2.95
*CS614|SAME
*CS615|STAN-CS-77-615*GLOWINSKI & PIRONNEAU,NUMERICAL METHODS|0|162|$ .00
*CS616|STAN-CS-77-616*KREISS & OLIGER,STABILITY OF FOURIER METHOD|0|143|$ .00
*AIM300|AIM-300*WINOGRAD, SOME CONTSTD SUPOSTONS...STDY OF LNGAGE|0|37|$ 2.40
*CS617|SAME
*P7728|HPP-77-28*NILSSON,PRODUCTION SYSTEM AUTO DEDUCTION|9|112|$ 2.90
*CS618|SAME
*CS619|STAN-CS-77-619*PAUL & TARJAN,TIME-SPACE TRADE-OFFS|47|195|$ 1.90
*CS620|STAN-CS-77-620*BOLSTAD & OLIGER,ADAPTATION OF FOURIER METHOD|0|0|$ .00
*P7725|HPP-77-25*FEIGENBAUM,ART OF ARTIFICIAL INTELLIGENCE|81|70|$ 2.20
*CS621|SAME
*CS622|STAN-CS-77-622*GOLUB ET AL.,GENERALIZED CROSS-VALIDATION|0|156|$ .00
*CS623|STAN-CS-77-623*BOLEY & GOLUB,INVERSE EIGENVALUE PROBLEMS|0|119|$ .00
*AIM301|AIM-301*EARNEST ET AL, RECENT RESEARCH IN COMPUTER SCIENCE|0|0|$ 5.00
*CS624|SAME
*CS625|STAN-CS-77-625*BROWN & TARJAN,FAST MERGING ALGORITHM|122|149|$ 2.90
*CS626|STAN-CS-77-626*YAO, LOOP SWITCHING ADDRESSING PROBLEM|106|188|$ 2.30
*CS627|STAN-CS-77-627*LIPTON & TARJAN, SEPARATOR THEOREM|115|171|$ 2.60
*CS628|STAN-CS-77-628*LIPTON & TARJAN, APPLICATIONS SEPARATOR THEOREM|110|172|$ 2.65
*CS629|STAN-CS-77-629*YAO, PATTERN MATCHING RANDOM STRING|61|156|$ 2.90
*AIM302|AIM-302*MANNA & WALDINGER, SYNTHESIS: DREAMS => PROGRAMS|37|62|$ 5.05
*CS630|SAME
*AIM303|AIM-303*MANNA & DERSHOWITZ, INFERANCE RULS...PRGRM ANOTATN|46|93|$ 3.00
*CS631|SAME
*AIM304|AIM-304*WAGNER, HARDWARE VERIFICATION (THESIS)|44|119|$ 4.55
*CS632|SAME
*AIM305|AIM-305*FAUGHT, MOTIVTN & INTNSONALTY IN COMP. SIMLTON MODEL (THESIS)|11|137|$ 4.60
*CS633|SAME
*CS634|STAN-CS-77-634*HOFFMANN & PARLETT, GLOBAL CONVERGENCE|0|105|$ 3.00
*CS635|STAN-CS-77-635*GOLUB ET AL.,  BLOCK LANCZOS METHOD|0|97|$ .00
*CS636|STAN-CS-77-636*BUBE, Cm CONVERGENCE TRIG INTERPOLANTS|0|167|$ .00
*VOL4|KNUTH, THE ART OF COMPUTER PROGRAMMING, VOLUME 4 (Preprint)|36|0|$ 2.00
*CS509|STAN-CS-75-509*OVERTON&PROSKUROSKI, FINDING MAXIMAL INCIDENCE:|6|0|$ 3.70
*ART|KNUTH,THE STATE OF THE ART OF COMPUTER PROGRAMMING|0|0|$ .00
*CS637|STAN-CS-78-637*RAMSHAW, GAP STRUCTURE SEQUENCES...POINTS ON A CIRCLE|148|198|$ 2.45
*CS638|STAN-CS-78-638*O'LEARY, GENERALIZED CONJUGATE GRADIENT ALGORITHM .....|11|210|$ 3.10
*AIM306|AIM-306*GREEN & BARSTOW, ON PROGRAM SYNTHESIS KNOWLEDGE|173|136|$ 3.45
*CS639|SAME
*AIM307|AIM-307*MANNA & WALDINGER, STRCTRD PRGRMNG W/O RECURSION|73|248|$ 2.00
*CS640|SAME
*AIM308|AIM-308*BARSTOW, AUTOMATIC CONSTRUCTION OF ALGORITHMS (THESIS)|0|258|$ 8.30
*CS641|SAME
*CS642|STAN-CS-78-642*A.YAO, CNSTRCTNG MINIMUM SPANNING TREES ......|79|157|$ 2.75
*CS643|STAN-CS-78-643*K.TANABE, A GEOMETRIC METHOD IN NONLINEAR PROGRAMMING|10|175|$ 3.20
*CS644|STAN-CS-78-644*MONT-REYNAUD, HIERARCHICAL PROPERTIES OF FLOWS ..... (THESIS)|79|189|$ 6.30
*CS645|STAN-CS-78-645*LIPTON, ROSE & TARJAN, GENERLIZED NESTED DISSECTION|138|181|$ 2.60
*AIM309|AIM-309*NELSON & OPPEN, EFCNT DECSION PROCDRS BASED ON CNGRUN CLSR|154|205|$ 2.50
*CS646|SAME
*CS647|STAN-CS-78-647*A.YAO, LOWER BOUND TO PALINDROME RECONGITION|40|145|$ 2.25
*P775|HPP-77-5*STEFIK & MARTIN, RVU KNLDGE PRBLM SLVNG...GNTCS EXPRIMNT|19|98|$ 2.75
*CS596|SAME
*CS648|STAN-CS-78-648*KNUTH, MATHEMATICAL TYPOGRAPHY|0|42|$ 3.60
*P781|HPP-78-1*BUCHANAN & FEIGENBAUM, DENDRAL & META-DENDRAL|22|170|$ 2.40
*CS649|SAME
*CS650|STAN-CS-78-650*LENGAUER & TARJAN, FAST ALGORITHM FINDING....|0|192|$ 2.80
*AIM310|AIM-310*DERSHOWITZ & MANNA, PROVING TERMINATION WITH MULTISET|42|94|$ 2.65
*CS651|SAME
*AIM311|AIM-311*NELSON & OPPEN,SIMPLIFIER N EFFICIENT ALGORITHMS|39|10|$ 2.25
*CS652|SAME
*CS653|STAN-CS-78-653*SHILOACH, MULTI-TERMINAL O-1 FLOW|90|244|$ 2.20
*CS654|STAN-CS-78-654*SHILOACH, TWO PATHS PROBLEM IS POLYNOMIAL|33|244|$ 2.40
*CS655|STAN-CS-78-655*DAHLQUIST,ACCURACY & UNCONDITIONAL STABILITY.....|162|232|$ 1.90
*CS656|STAN-CS-78-656*HEATH, NUMERICAL ALGORITHMS..... (THESIS)|0|203|$ 5.70
*AIM312|AIM-312*MCCARTHY ET AL., MODEL THEORY OF KNOWLEDGE|133|91|$ 2.00
*CS657|SAME
*CS658|STAN-CS-78-658*SHUSTEK, ANALYSIS & PERFORMANCE .... (THESIS)|70|175|$ 6.00
*SLAC205|SAME
*CS659|STAN-CS-78-659*ZOLNOWSKY, TOPICS IN COMPUTATIONAL GEOMETRY (THESIS)|114|200|$ 3.45
*SLAC206|SAME
*AIM313|AIM-313*SHIMANO, KINEMATIC DESIGN & FORCE CONTROL..... (THESIS)|10|299|$ .00
*CS660|SAME
*CS661|STAN-CS-78-661*GILBERT & TARJAN, VARIATIONS OF A PEBBLE GAME|88|150|$ 2.35
*CS662|STAN-CS-78-662*A. YAO, NEW ALGORITHMS IN BIN PACKING|48|152|$ 3.10
*CS663|STAN-CS-78-663*GROSSE, SOFTWARE RESTYLING IN GRAPHICS|0|128|$ 2.55
*CS664|STAN-CS-78-664*BJORSTAD & NOCEDAL, ANALYSIS OF A NEW ALGORITHM|66|156|$ 2.20
*CS665|STAN-CS-78-665*MCWILLIAMS & WIDDOES, SCALD|0|144|$ 2.80
*TR152|SAME
*CS666|STAN-CS-78-666*MCWILLIAMS & WIDDOES, SCALD PHYSICAL DESIGN SUBSYSTEM|13|154|$ 2.50
*TR153|SAME
*P787|HPP-78-7*SMITH & DAVIS, DISTRIBUTED PROBLEM SOLVING|7|78|$ 2.50
*CS667|SAME
*P7810|HPP-78-10*BONNET, BAOBAB|17|117|$ 2.85
*CS668|SAME
*CS669|STAN-CS-78-669*STOCKMEYER & F.YAO, OPTIMALITY OF LINEAR MERGE|29|159|$ 2.05
*CS670|STAN-CS-78-670*GRAHAM ET AL, INFORMATION BOUNDS ARE WEAK....|0|164|$ 2.80
*AIM316|AIM-316*GINSPARG, NATURAL LANGUAGE PROCESSING (THESIS)|77|247|$ 6.55
*CS671|SAME
*CS672|STAN-CS-78-672*T. CHAN, COMPARISON OF NUMERICAL METHODS (THESIS)|0|270|$ 6.00
*CS673|STAN-CS-78-673*CHAN ET AL, NUMERICAL LIBRARY & ITS SUPPORT|0|278|$ 2.35
*CS674|STAN-CS-78-674*T.CHAN & GLOWINSKI, FINITE ELEMENT APPOXIMATION|68|285|$ 3.85
*AIM317|AIM-317*KNUTH, TAU EPSILON CHI, A SYSTEM FOR TECHNICAL TEXT|17|244|$ 7.50
*CS675|SAME
*CS676|STAN-CS-78-676*BANNING, DETERMINING SIDE EFFECTS OF PRROCEDURE CALLS (THESIS)|0|134|$ .00
*CS677|STAN-CS-78-677*LIANG, COMPREHENSIVE EXAMS AT STANFORD 1972-78|82|8|$ 8.40
*AIM314|AIM-314*OPPEN, REASONING ABOUT RECURSIVED DEFINED DATA STRUCTURES|98|276|$ 2.15
*CS678|SAME
*CS679|STAN-CS-78-679*MURRAY & OVERTON, STEPLENGTH ALGORITHMS|84|285|$ 3.30
*CS680|STAN-CS-78-680*STANLEY, BIBLIOGRAPHY OF STANFORD CS REPORTS 1963-78|0|0|$ .00
*CS681|STAN-CS-78-681*TRABB PARDO, SET REPRESENTATION & INTERSECTION (THESIS)|0|78|$ 4.10
*CS682|STAN-CS-78-682*VALDES, PARSING FLOWCHARTS & SERIES-PARALLEL GRAPHS (THESIS)|0|87|$ 8.25
*CS683|STAN-CS-78-683*TARJAN, STORING A SPARSE TABLE|0|79|$ 2.35
*CS684|STAN-CS-78-684*BOLEY & BOLUB, MATRIX INVERSE EIGENVALUE PROBLEM|20|103|$ 2.20
*CS685|STAN-CS-78-685*LUK, SPARSE & PARALLEL MATRIX COMPUTATIONS (THESIS)|10|59|$ 6.40
*CS686|STAN-CS-78-686*LIPTON ET AL, EXTERNAL HASHING SCHEMES|15|109|$ 2.65
*AIM315|AIM-315*WEYHRAUCH, PROLEGOMENA TO A THEORY OF FORMAL REASONING|265|87|$ 2.85
*CS687|SAME
*AIM318|AIM-318*MANNA, 6 LECTURES ON THE LOGIC OF COMPUTER PROGRAMMING|150|197|$ 3.25
*CS688|SAME
*AIM319|AIM-319*NELSON, AN N↑LOGN ALGORITHM FOR TWO-VARIABLE-PER CONSTRAINT|256|187|$ 2.30
*CS689|SAME
*AIM320|AIM-320*MANNA, A DEDUCTIVE APPROACH TO PROGRAM SYNTHESIS|169|80|$ 2.55
*CS690|SAME
*CS691|STAN-CS-78-691*BUBE, CONSTURCTION OF INITIAL DATA (THESIS)|23|280|$ 5.05
*P7739|HPP-77-39*BUCHANAN ET AL., MODELS OF LEARNING SYSTEMS|0|270|$ 2.80
*CS692|SAME
*CS693|STAN-CS-78-693*WEST, CLASS OF SOLUTIONS TO GOSSIP PROBLEM|71|288|$ 3.45
*CS694|STAN-CS-78-694*KING, COMPUTER SCIENCE @ STANFORD, 1977-1978|0|4|$ 2.50
*AIM321|AIM-321*MCCARTHY ET AL, RECENT RESEARCH IN AI & FOUNDATIONS OF PROGRAM.|2|300|$ 4.35
*CS695|SAME
*P7822|HPP-78-22*SMITH & MITCHELL, MICROPROCESSOR-BASED TERMINAL DESIGN|50|277|$ 2.10
*CS696|SAME
*CS697|STAN-CS-78-697*GANDER, LINEAR LEAST SQUARES PROBLEM W/QUADRATIC CONSTRAINT|16|275|$ 5.10
*CS698|STAN-CS-78-698*SWEET, EMPIRICAL ESTIMATES OF PROGRAM ENTROPY (THESIS)|0|276|$ 6.40
*P7823|HPP-78-23*BENNET ET AL., SACON: KNOWLEDGE-BASED CONSULTANT|10|197|$ 3.55
*CS699|SAME
*CS700|STAN-CS-78-700*SMITH, FRAMEWORK FOR PROBLEM SOLVING (THESIS)|0|9|$ 5.90
*CS701|STAN-CS-79-701*MODEL, MONITORING SYSTEM BEHAVIOR (THESIS)|14|11|$ 7.00
*CS702|STAN-CS-78-702*SHILOACH, AN O(N.ILOG↑2I) MAXIMUM-FLOW ALGORITHM|93|129|$ 2.65
*CS703|STAN-CS-79-703*ASPVAL & SHILOACH, A POLYNOMIAL TIME ALGORITHM|69|137|$ 2.40
*CS704|STAN-CS-79-704*SWEET, SURVEY STATE OF SOFTWARE PARTIAL DIFFER. EQUATIONS (THESIS)|82|70|$ 2.60
*CS705|STAN-CS-79-705*DRYSDALE, GENERALIZED VORONOI DIAGRAMS (THESIS)|8|58|$ 7.20
*CS706|STAN-CS-79-706*F. YAO, GRAPH 2-ISOMORPHISM IS NP-COMPLETE|81|137|$ 2.05
*CS707|STAN-CS-79-707*VAN WYK & KNUTH, PROGRAMMING & PROBLEM-SOLVING SEMINAR|0|7|$ 4.05
*CS708|STAN-CS-79-708*A. YAO, ANALYSIS OF MEMORY ALLOCATION SCHEME IMPLEMENTING STACKS|99|93|$ 2.20
*CS709|STAN-CS-78-709*BROWN & TARJAN, DESIGN & ANALYSIS OF A DATA STRUCTURE|61|73|$ 3.10
*CS710|STAN-CS-79-710*TREFETHEN, NUMERICAL COMPUTATION OF SCHWARZ-CHRISTOFFEL|19|147|$ 2.90
*CS711|STAN-CS-78-711*T. MITCHELL, VERSION SPACES (THESIS)|9|65|$ 7.75
*CS712|STAN-CS-79-712*KNUTH, ERRATA OF COMPUTER PROGRAMMING|0|41|$ 3.35
*CS713|STAN-CS-79-713*GOLUB ET AL, HESSENBERG-SCHUR METHOD FOR AX + XB = C|38|106|$ 3.10
*TR160|CSL TR-160*CASTANEDA ET AL, PCFORT:A FORTRAN-TO-PCODE TRANSLATOR|9|0|$ 4.95
*CS714|SAME
*TR161|CSL TR-161*HAILPERN & HITSON, S-1 ARCHITECTURE MANUAL|0|0|$ 12.20
*CS715|SAME
*AIM322|AIM-322*GEORGEFF, A FRAMEWORK FOR CONTROL IN PRODUCTION SYSTEMS|57|285|$ 2.70
*CS716|SAME
*AIM324|AIM-324*CARTWRIGHT & MC CARTHY, RECURSIVE PROGRAMS AS FUNCTIONS IN A FIRST ORDER THEORY|77|289|$ 2.60
*CS717|SAME
*AIM323|AIM-323*MUJTABA & GOLDMAN, AL USERS' MANUAL|42|383|$ 5.55
*CS718|SAME
*CS719|STAN-CS-79-719*BJ0RSTAD ET AL, EXTRAPOLATION OF ASYMOTOTIC EXPANSIONS|27|157|$ 3.25
*CS720|STAN-CS-79-720*GLOWINSKI, GRID OPTIMIZATION FOR BOUNDARY VALUE PROBLEMS|36|142|$ 2.35
*CS721|STAN-CS-79-721*A. YAO & F. YAO, FAULT-TOLERANT NETWORKS FOR SORTING|94|168|$ 2.30
*CS722|STAN-CS-79-722*WIEDERHOLD & EL-MASRI, STRUCTURAL MODEL FOR DATABASE SYS.|41|288|$ 3.30
*CS723|STAN-CS-79-723*SHORTLIFFE ET AL, KNOWLEDGE ENG. FOR MEDICAL DECISION MAKING|11|96|$ 3.20
*AIM325|AIM-325*MC CARTHY, FIRST ORDER THEORIES OF INDIVIDUAL CONCEPTS AND PROPOSITIONS|16|283|$ 2.25
*CS724|SAME
*AIM326|AIM-326*MC CARTHY, ASCRIBING MENTAL QUALITIES TO MACHINES|0|274|$ 2.40
*CS725|SAME
*CS726|STAN-CS-79-726*A. YAO, AN ANALYSIS OF (h,k,l)-SHELLSORT|28|172|$ 3.25
*AIM327|AIM-327*FILMAN, INTERACTION OF OBSERVATION & INFERENCE (THESIS)|26|149|$ 8.20
*CS727|SAME
*CS728|STAN-CS-79-728*SHILOACH, UNION-MEMBER ALGORITHMS FOR NON-DISJOINT SETS|70|166|$ 2.05
*CS729|STAN-CS-79-729*TARJAN, UNIFIED APPROACH TO PATH PROBLEM|29|282|$ 2.90
*CS730|STAN-CS-79-730*LIANG, QUALIFYING EXAMS 1965-78|231|196|$ 8.40
*PVG11|PVG-11*LUCKHAM ET AL, PASCAL VERIFIER MANUAL|134|282|$ 4.95
*CS731|SAME
*CS732|STAN-CS-79-732*WOODS, INTRODUCTORY COMBINATORICS|15|243|$ 5.10
*CS733|STAN-CS-79-733*A. YAO, LOWER BOUND TO FIND CONVEX HULLS|134|286|$ 2.35
*CS734|STAN-CS-79-734*TARJAN, FAST ALGORITHMS SOLVING PATH PROBLEM|57|284|$ 3.10
*CS735|STAN-CS-79-735*WILKINSON, KRONECKER'S CANONICAL FORM|61|282|$ 2.35
*CS736|STAN-CS-79-736*WILKINSON, PRACTICAL SIGNIF. OF DRAZIN INVERSE|72|283|$ 2.30
*CS737|STAN-CS-79-737*A.YAO & F.YAO, AVERAGE-CASE COMPLEXITY|75|286|$ 3.00
*CS738|STAN-CS-79-738*LEVEQUE ET AL, COMPUTATION RELATED TO G-STABILITY|53|281|$ 2.50
*P7914|HPP-79-14*QUINLAN, INDUCTION OVER LARGE DATA BASES|68|282|$ 2.25
*CS739|SAME
*PVG12|PVG-12*CARTWRIGHT & OPPEN, LOGIC OF ALIASING|111|246|$ 2.40
*CS740|SAME
*CS741|STAN-CS-79-741*RAMSHAW, FORMALIZING ANALYSIS OF ALGORITHMS (THESIS)|21|172|$ 5.15
*P7912|HPP-79-12*GARDNER, SEARCH (A.I. HANDBOOK)|0|99|$ 4.50
*CS742|SAME
*AIM328|AIM-328*BULNES-ROZAS, GOAL (THESIS)|222|383|$ 6.70
*CS743|SAME
*CS744|STAN-CS-79-744*GARCIA-MOLINA, PERFORMANCE OF UPDATE ALGORITHMS (THESIS)|136|287|$ 6.20
*TR172|SAME
*CS745|STAN-CS-79-745*LENGAUER, UPPER & LOWER BOUNDS (THESIS)|182|285|$ 4.05
*CS746|STAN-CS-79-746*BORNING, THINGLAB (THESIS)|15|281|$ 4.75
*AIM329|AIM-329*WILKINS, USING PATTERNS & PLANS (THESIS)|16|238|$ 9.10
*CS747|SAME
*CS748|STAN-CS-79-748*YUN, FAST ALGORITHSM FOR SOLVING TOEPLITZ SYSTEM...|199|379|$ 1.95
*P7917|HPP-79-17*CLANCEY ET AL, EDUCATION (SECTION OF A.I. HANDBOOK)|0|92|$ 3.40
*CS749|SAME
*CS750|STAN-CS-79-750*GACS & LAVOSZ, HACHIAN'S ALGORITHM|248|297|$ 2.10
*AIM330|AIM-330*MANNA & PNUELI, MODAL LOGIC OF PROGRAMS|338|298|$ 2.75
*CS751|SAME
*CS752|STAN-CS-79-752*OVERTON, PROJECTED LAGRANGIAN ALGORITHMS (THESIS)|129|237|$ 6.30
*CS753|STAN-CS-79-753*A. YAO, SHOULD TABLES BE SORTED?|175|241|$ 2.75
*P7921|HPP-79-21*GARDNER ET AL, NATURAL LANGUAGE UNDERSTANDING (A.I. HANDBOOK)|0|83|$ 4.50
*CS754|SAME
*AIM331|AIM-331*KANT, EFFICIENCY CONSIDER IN PROGRAM SYNTHESIS (THESIS)|0|94|$ 6.20
*CS755|SAME
*P7922|HPP-79-22*BENNETT ET AL, SCIENCE & MATHEMATICS (A.I. HANDBOOK)|0|88|$ 4.80
*CS756|SAME
*P7923|HPP-79-23*CIESIELSKI ET AL, MEDICINE (SECTION OF A.I. HANDBOOK)|0|89|$ 2.85
*CS757|SAME
*P7924|HPP-79-24*ELSCHLAGER & PHILLIPS, AUTOMATIC PROGRAMMING (A.I. HANDBOOK)|0|89|$ 4.50
*CS758|SAME
*P7925|HPP-79-25*BONNET, SCHEMA-SHIFT STRATEGIES|107|234|$ 2.85
*CS759|SAME
*CS760|STAN-CS-79-760*GRAHAM ET AL, MONOTONICITY PROPERTIES OF PARTIAL ORDERS|125|97|$ 2.30
*CS761|STAN-CS-79-761*WEST, GOSSIPING WITHOUT DUPLICATE TRANSMISSIONS|118|98|$ 1.90
*AIM332|AIM-332*KNUTH, METAFONT: A SYSTEM FOR ALPHABET DESIGN|448|97|$ 4.70
*CS762|SAME
*CS763|STAN-CS-79-763*WEST, SYMMETRIC CHAIN DECOMPOSITION OF L(4,n)|172|249|$ 2.20
*CS764|STAN-CS-79-764*A. YAO, TIME-SPACE TRADEOFF FOR SORTING W/ LINEAR QUERIES|164|99|$ 2.65
*CS765|STAN-CS-79-765*GACS, RELATION BETWEEN COMPLEXITY & PROBABILITY|171|98|$ 1.95
*CS766|STAN-CS-79-766*KAUTSKY & NICHOLS, EQUIDISTRIBUTING MESHES W/ CONSTRAINTS|86|98|$ 2.45
*0|SAME
*CS767|STAN-CS-79-767*VAN LOAN, STEWART'S SINGULAR VALUE DECOMPOSITION|67|97|$ 2.20
*CS768|STAN-CS-79-768*GACS & LEVIN, CAUSAL NETWORKS|0|0|$ 2.40
*CS769|STAN-CS-79-769*CLANCEY, TRANSFER OF RULE-BASED EXPERTISE (THESIS)|44|146|$ 4.95
*CS770|PVG-13*OPPEN, PRETTY PRINTING|0|147|$ 2.30
*PVG13|SAME
*P7929|HPP-79-29*FRIEDLAND, KNOWLEDGE-BASED EXPERIMENT DESIGN (THESIS)|20|150|$ 2.70
*CS771|SAME
*AIM333|AIM-333*MCCUNE, BUILDING PROGRAM MODELS INCREMENTALLY (THESIS)|61|135|$ 5.70
*CS772|SAME
*CS773|STAN-CS-79-773*CHAN ET AL, UPDATING FORMULAE & PAIRWISE ALGORITHM|94|267|$ 2.25
*CS774|STAN-CS-79-774*GOLUB & PLEMMONS, LARGE SCALE GEODETIC LEAST SQUARES ADJUSTMENT|94|265|$ 2.65
*CS775|STAN-CS-79-775*DIACONIS & GRAHM, ANALYSIS OF SEQUENTIAL EXPERIMENTS|161|285|$ 3.05
*CS776|STAN-CS-79-776*ASPVALL & STONE, KHACHIYAN'S ALGORITHM|0|572|$ 2.10
*CS777|STAN-CS-79-777*GRAHAM & SLOANE, CONSTANT WEIGHT CODES & HARMONIOUS GRAPHS|191|269|$ 2.20
*CS778|STAN-CS-79-778*SHAW, HIERARCHICAL ASSOCIATIVE ARCHITECTURE|94|270|$ 3.30
*CS779|STAN-CS-80-779*MANNA & WALDINGER, PROBLEMATIC FEATURES OF PROGRAMMING LANGUAGES|168|0|$ 3.70
*CS780|STAN-CS-80-780*KNUTH, COMPUTER MODERN FAMILY OF TYPEFACES|237|282|$ 7.60
*CS781|HPP-79-30*KING, EXPLORING USE OF DOMAIN KNOWLEDGE FOR QUERY PROCESSING|2|287|$ 2.30
*P7930|SAME
*BIB|CSR-DOC-001*STANLEY, BIBLIOGRAPHY OF REPORTS|429|0|$ .00
*CS782|STAN-CS-79-782*MANNA & PNUELI, SYNCHRONOUS SCHEMES...|0|0|$ 2.75
*CS783|PVG-14*KARP, PROVING CONCURRENT SYSTEMS CORRECT (THESIS)|56|275|$ 5.95
*PVG14|SAME
*CS784|HPP-80-2*STEFIK, PLANNING WITH CONSTRAINTS (THESIS)|75|281|$ 4.95
*P802|SAME
*CS785|PVG-15*HUET & OPPEN, EQUATIONS & REWRITE RULES|2|289|$ 3.20
*PVG15|SAME
*CS786|STAN-CS-80-786*KNUTH, ALGORITHMS IN MODERN MATH & CS|254|285|$ 2.50
*CS787|STAN-CS-80-787*SYMM & WILKINSON, REALISTIC ERROR BOUNDS...|93|288|$ 2.35
*CS788|AIM-334*MCCARTHY, CIRCUMSCRIPTION|17|286|$ 2.15
*AIM334|SAME
*CS789|PVG-16*LUCKHAM & POLAK, ADA EXCEPTIONS|30|218|$ 2.25
*PVG16|SAME
*CS790|STAN-CS-80-790*WIEDERHOLD, DATABASES IN HEALTHCARE|9|241|$ 3.85
*CS791|STAN-CS-80-791*WILCOX ET AL., MAINSAIL LANGUAGE MANUAL|151|207|$ 8.65
*TR166|SAME
*CS792|STAN-CS-80-792*WILCOX ET AL., MAINSAIL IMPLEMENTATION OVERVIEW|150|225|$ 3.70
*TR167|SAME
*CS793|HPP-80-3*BARR & DAVIDSON, REPRESENTATION OF KNOWLEDGE (AI HANDBOOK)|182|0|$ 4.00
*P803|SAME
*CS794|STAN-CS-80-794*TARJAN, RECENT DEVELOP. IN COMPLEXITY OF COMBINATORIAL ...|87|172|$ .00
*P804|SAME
*CS795|STAN-CS-80-795*KNUTH, THE LETTER S|236|182|$ 2.65
*CS796|AIM-335*SAMUEL, ESSENTIAL E|191|213|$ 1.00
*AIM335|SAME
*CS797|STAN-CS-80-797*GARCIA-MOLINA & WIEDERHOLD, READ-ONLY TRANSACTIONS...|175|251|$ 2.40
*CS798|STAN-CS-80-798*FLOYD & ULLMAN, COMPILATION OF REGULAR EXPRESSIONS...|187|231|$ 2.50
*CS799|STAN-CS-80-799*FRIEDMAN ET AL., MULTIDIMENSIONAL ADDITIVE SPLINE APPROX.|178|227|$ 2.35
*SLAC2504|SAME
*CS800|STAN-CS-80-800*KNUTH, DECIPHERING A LINEAR CONGRUENTIAL ENCRYPTION|0|0|$ 2.00
*CS801|STAN-CS-80-801*EL-MASRI, DESIGN USE & INTEGRATION OF DATA MODELS (THESIS)|46|12|$ 5.00
*PVG17|PVG-17*POLAK, THEORY OF COMPILER SPECIFICATION & VERIFICATION (THESIS)|23|109|$ 5.75
*CS802|SAME
*CS803|STAN-CS-80-803*VAN WYK, LANGUAGE FOR TYPESETTING GRAPHICS (THESIS)|67|220|$ 3.35
*AIM336|AIM-336*M. BROOKS, DETERMINING CORRECTNESS BY TESTING (THESIS)|48|232|$ 5.50
*CS804|SAME
*AIM339|AIM-339*GENNERY, MODELLING ENVIRONMENT OF EXPLORING VEHICLS..(THESIS)|0|0|$ 5.00
*CS805|SAME
*CS806|STAN-CS-80-806*COUGHRAN, APPROXIMATE SOLUTION OF HYPERBOLIC... (THESIS)|67|0|$ 5.00
*CS807|STAN-CS-80-807*MATULA & DOLEV, PATH-REGULAR GRAPHS|145|0|$ 3.00
*CS808|AIM-337*MC CARTHY ET ALL, BASIC RESEARCH IN AI & FOUNDATIONS OF PROGRAMMING|28|0|$ 3.95
*AIM337|SAME
*AIM338|AIM-338*OHWOVORIOLE, EXTENSION OF SCREW THEORY (THESIS)|87|0|$ 4.50
*CS809|SAME
*CS810|STAN-CS-80-810*STEEL & YAO, LOWER BOUNDS FOR ALGEBRAIC DECISION TREES|86|298|$ 2.10
*CS811|PVG-18*GERMAN, EXTENDED SEMANTIC DEFINITION OF PASCAL...|0|0|$ 3.45
*PVG18|SAME
*CS812|HPP-80-21*FEIGENBAUM, KNOWLEDGE ENGINEERING|50|0|$ 2.15
*P8021|SAME
*CS813|AIM-340*MORAVEC, OBSTACLE AVOIDANCE & NAVIGATION... (THESIS)|51|0|$ 4.35
*AIM340|SAME
*CS814|HPP-80-17*AIKINS, PROTOTYPES & PRODUCTION RULES (THESIS)|0|0|$ 4.80
*CS815|HPP-80-16*SHORTLIFFE, TWO PAPERS ON MEDICAL COMPUTING|53|0|$ 3.40
*P8017|SAME
*P8016|SAME
*CS816|STAN-CS-80-816*BLUM, AUTOMATING THE STUDY OF CLINICAL HYPOTHESES...|24|0|$ 2.10
*CS817|STAN-CS-80-817*VITTER, ANALYSIS OF COALESCED HASHING (THESIS)|3|0|$ 3.40
*CS818|AIM-341*SCHERLIS, EXPRESSION PROCEDURES & PROGRAM DERIVATION (THESIS)|69|0|$ 4.40
*AIM341|SAME
*CS819|STAN-CS-80-819*GOAD, COMPTATAL USES OF THE MANPULATN OF FORMAL PROOFS (THESIS)|59|0|$ 5.60
*CS820|HPP-80-22*VAN MELLE, DOMAIN-INDEPENDENT SYSTEM THAT AIDS CONSTRUCTING...THESIS)|0|0|$ 4.60
*P8022|SAME
*CS821|STAN-CS-80-821*WEST & TOVEY, SEMIANTICHAINS & UNICHAIN COVERINGS...|0|0|$ 2.30
*CS822|STAN-CS-80-822*ASPVAL, EFFICIENT ALGORITHMS FOR CERTAIN SATISFIABILITY (THESIS)|0|0|$ 5.00
*CS823|STAN-CS-80-823*SHAW, KNOWLEDGE-BASED RETRIEVAL.... (THESIS)|0|0|$ 3.80
*CS824|STAN-CS-80-824*YUN MEI TUNG, LCCD, A LANGUAGE FOR CHINESE CHARACTER DESIGN|4|0|$ 3.60
*CS825|STAN-CS-80-825*SCHNORR, REFINED ANAAYSIS & IMPROVEMENTS ON SOME FACTORING...|4|100|$ 2.60
*CS826|STAN-CS-80-826*WIEDERHOLD ET AL, A DATABASE APPROACH TO COMMUNICATION...|0|100|$ 2.05
*CS827|STAN-CS-80-827*YAO, ON THE PARALLEL COMPUTATION FOR THE KNAPSACK...|0|0|$ 2.05
*CS828|STAN-CS-80-828*KNUTH & PLASS, BREAKING PARAGRAPHS INTO LINES|0|0|$ 3.70
*CS829|STAN-CS-80-829*ASPVALL & LIANG, THE DINNER TABLE PROBLEM|0|0|$ 2.15
*CS830|STAN-CS-80-830*MATULA, SHILOACH & TARJAN, TWO LINEAR-TIME ALGORITHMS ...|0|0|$ 2.40
*CS831|STAN-CS-80-831*SLEATOR, AN O(NMLOGN) ALGORITHM FOR MAXIMUM NETWORK FLOW|3|50|$ 4.45
*CS832|STAN-CS-80-832*DOLEV,SCHEDULING WIDE GRAPHS|245|400|$ 3.30
*CS833|STAN-CS-80-833*GILBERT, GRAPH SEPARATOR THEOREMS ... |251|400|$ 5.15
*CS834|STAN-CS-80-834*BJORSTAD, NUMERICAL SOLUTION OF THE BIHARMONIC EQUATION|0|400|$ 2.90
*CS835|STAN-CS-80-835*GROSSE, APPROX. & OPTIMIZATION OF ELECTRON DENSITY MAPS|0|400|$ 8.00
*CS837|STAN-CS-81-837*BUCHANAN, RESEARCH ON EXPERT SYSTEMS|257|400|$ 3.15
*CS838|STAN-CS-81-838*BROWN,DYNAMIC PROGRAM BUILDING|218|400|$ 2.40
*CS839|STAN-CS-81-839*SAMUEL,SHORT WAITS|231|0|$ 3.15
*CS840|STAN-CS-81-840*KNUTH, VERIFICATION OF LINK LEVEL PROTOCOLS|288|400|$ 2.20
*CS841|STAN-CS-81-841*KNUTH,HUFFMANS ALGORITHM VIA ALGEBRA|139|400|$ 2.20
*CS842|STAN-CS-81-842*GENESERETH, RULE OF PLANS IN INTELLIGENT TEACHING SYSTEMS|200|0|$ 2.60
*P814|SAME
*CS846|STAN-CS-81-846*DOLEV,THE BYZANTINE GENERALS STRIKE AGAIN|196|400|$ 2.80
*CS847|STAN-CS-81-847*KORTH, OPTIMAL LOCKING PROBLEM IN DIRECTED ACYCLIC GRAPH|223|400|$ 2.20
*CS848|STAN-CS-81-848*CHIH-SUNG TANG,ON THE PROBLEM OF INPUTTING CHINESE CHARACTERS|208|400|$ 2.30
*CS849|STAN-CS-81-849*NISHIGAKI,EXPERIMENTS ON THE KNEE CRITERION ...|249|400|$ 2.85
*CS850|STAN-CS-81-850*SPECTOR,PRFRMING REMOTE OPERATIONS ... LOCAL NETWORK|188|400|$ 2.70
*TR207|SAME
*CS851|STAN-CS-81-851*WIEDERHOLD,BINDING IN INFORMATION PROCESSING|251|400|$ 3.25
*CS852|STAN-CS-81-852*ULLMAN,A VIEW OF DIRECTIONS IN RELATIONAL DATABASE THEORY|187|400|$ 2.30
*CS853|STAN-CS-81-853*MAIER & ULLMAN, CONNECTIONS IN ACYCLIC HYPERGRAPHS|261|400|$ 2.30
*CS854|STAN-CS-81-854*DOLEV, YAO,ON THE SECURITY OF PUBLIC KEY PROTOCOLS|224|400|$ 2.65
*CS855|STAN-CS-81-855*MANNA & WALDINGER, DEDUCTIVE SYNTHESIS OF THE UNIFICATION ALGORITHM|351|400|$ 3.55
*CS856|STAN-CS-81-856*GABRIEL, AN ORGANIZATION FOR PROGRAMS IN FLUID DOMAINS|136|175|$ .00
*CS857|STAN-CS-81-857*KING, QUERY OPTIMIZATION BY SEMANTIC REASONING|409|400|$ 5.85
*CS858|STAN-CS-81-858*PAN, THE BIT-OPERATION COMPLEXITY|281|400|$ 2.20
*CS859|STAN-CS-81-859*PAN, THE ADDITIVE AND LOGICAL COMPLEXITIES|281|400|$ 2.65
*CS860|STAN-CS-81-860*BOLEY, COMPUTING CONTROLLABILITY/OBSERVABILITY|263|400|$ 4.45
*CS861|STAN-CS-81-861*BROOKS, SYMBOLIC REASONING AMONG 3-D MODELS AND 2-D IMAGES|250|400|$ 7.45
*CS862|STAN-CS-81-862*PAN, THE LOWER BOUNDS ON THE ADDITIVE COMPLEXITY|283|400|$ 2.10
*CS863|STAN-CS-81-863*KNUTH & MILLER, A PROGRAMMING AND PROBLEM-SOLVING SEMINAR|238|400|$ 4.50
*CS864|STAN-CS-81-864*DOYLE, THREE SHORT ESSAYS ON DECISIONS, REASONS, AND LOGICS|226|400|$ 2.60
*CS865|STAN-CS-81-865*TANG, TOWARD A UNIFIED LOGICAL BASIS FOR PROGRAMMING LANGUAGES|272|0|$ 2.65
*CS866|STAN-CS-81-866*GERMAN, VERIFYING THE ABSENCE OF COMMON RUNTIME ERRORS IN COMPUTER PROGRAMS|250|400|$ 7.40
*CS867|STAN-CS-81-867*LUCKHAM,LARSEN,STEVENSON,VONHENKE, ADAM-AN ADA BASED LANGUAGE FOR MULTI-PROCESSING|225|400|$ 4.15
*CS868|STAN-CS-81-868*KNUTH, THELAST WHOLE ERRATA CATALOG|265|400|$ 3.25
*CS869|STAN-CS-81-869*TAJNAI, COMPREHENSIVE EXAMINATIONS IN COMPUTER SCIENCE 1978/79-1980/81|300|300|$ 15.00